Efficient path and vertex exchange insteiner tree algorithms

Networks

Volumn 29, Issue 2, 1997, Pages 89-105

  Duin, Cees ^a   Voß, Stefan ^b  

^a UNIVERSITY OF AMSTERDAM   (Netherlands)

^b TECHNICAL UNIVERSITY OF BRAUNSCHWEIG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0040052113     PISSN: 00283045     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1097-0037(199703)29:2<89::AID-NET3>3.0.CO;2-7     Document Type: Article

References (23)

1. A. V. Aho, J. E. Hopcroft, and J. D. Ullman, Data Structures and Algorithms. Addison-Wesley, Reading, MA (1983).
2. [ 2] J. E. Beasley, OR-Library: Distributing test problems by electronic mail. J. Oper. Res. Soc. 41 (1990) 1069-1072.
3. E. W. Dijkstra, A note on two problems in connexion with graphs. Num. Math. 1 (1959) 269-271.
4. K. A. Dowsland, Hill-climbing, simulated annealing and the Steiner problem in graphs. Eng. Optim. 17 (1991) 91-107.
5. C. W. Duin, De getemde bliksem. Caleidoscoop op de Levende Besliskunde (C. W. Duin and A. Volgenant, Eds.). FEE Universiteit van Amsterdam (1991) 197-212.
6. C. W. Duin, Steiner's problem in graphs. PhD Thesis. University of Amsterdam (1993).
7. C. W. Duin and S. Voß. Steiner tree heuristics - A survey. Operations Research Proceedings (DGOR-NSOR) (H. Dyckhoff, U. Derigs, and M. Salomon, Eds.). Springer-Verlag, Berlin, Heidelberg (1994) 485-496.
8. C. W. Duin and A. Volgenant, Reduction tests for the Steiner problem in graphs. Networks 19 (1989) 549-567.
9. C. W. Duin and S. Voß, The pilot method - A strategy for heuristic repetition with application to the Steiner problem in graphs. Working paper, FEE University of Amsterdam (1995).
10. M. L. Fredman and R. E. Tarjan, Fibonacci heaps and their uses in improved network optimization algorithms. J. ACM 34 (1987) 596-615.
11. F. K. Hwang, D. S. Richards, and P. Winter, The Steiner tree problem. Ann. Discr. Math. 53 (1992).
12. A. Kapsalis, V.J. Rayward-Smith, and G. D. Smith, Solving the graphical Steiner tree problem using genetic algorithms. J. Oper. Res. Soc. 44 (1993) 397-406.
13. B. Korte, Applications of combinatorial optimization. Mathematical Programming (M. Iri and K. Tanabe, Eds.). KTK, Tokyo (1989) 1-55.
14. L. Kou, G. Markowsky, and L. Berman, A fast algorithm for Steiner trees. Acta Inf. 15 (1981) 141-145.
15. K. Mehlhorn, A faster approximation algorithm for the Steiner problem in graphs. Inf Process. Lett. 27 (1988) 125-128.
16. M. Minoux, Efficient greedy heuristics for Steiner tree problems using reoptimization and supermodularity. IN-FOR 28 (1990) 221-233.
17. R. C. Prim, Shortest connection networks and some generalizations. Bell Syst. Tech. J. 36 (1957) 1389-1401.
18. V. J. Rayward-Smith and A. Clare, On finding Steiner vertices. Networks 16 (1986) 283-294.
19. P. M. Spira, On finding and updating spanning tree and shortest paths. SIAM J. Comput. 4 (1975) 375-380.
20. H. Takahashi and A. Matsuyama, An approximate solution for the Steiner problem in graphs. Math. Jpn. 24 (1980) 573-577.
21. P. Winter and J. MacGregor Smith, Path-distance heuristics for the Steiner problem in undirected networks. Algorithmica 7 (1992) 309-327.
22. A. Z. Zelikovsky, An 11/6 approximation algorithm for the Steiner problem in graphs. Fourth Symposium on Combinatorics, Graphs and Complexity (J. Nesetril and M. Fiedler, Eds.). Elsevier North-Holland, Amsterdam (1992) 351-354.
23. A. Z. Zelikovsky, A faster 11/6 approximation algorithm for the Steiner problem in graphs. Inf. Process. Lett. 46 (1993) 79-83.