Concatenation-based greedy heuristics for the Euclidean steiner tree problem

Algorithmica (New York)

Volumn 25, Issue 4, 1999, Pages 418-437

  Zachariasen, M ^a   Winter, P ^a  

^a UNIVERSITY OF COPENHAGEN   (Denmark)

Author keywords

Heuristics; Steiner trees

Indexed keywords

EID: 8444249219     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00009287     Document Type: Article

References (25)

1. S. Arora. Polynomial Time Approximation Schemes for Euclidean TSP and Other Geometric Problems. In Proc. 31th Ann. Symp. on Foundations of Computer Science, pages 2-13, 1996.
2. J. Beardwoord, J. H. Halton, and J. M. Hammersley. The Shortest Path Through Many Points. Proceedings of the Cambridge Philosophical Society, 55:299-327, 1959.
3. J. E. Beasley. OR-Library: Distributing Test Problems by Electronic Mail. Journal of the Operational Research Society, 41:1069-1072, 1990.
4. J. E. Beasley. A Heuristic for Euclidean and Rectilinear Steiner Problems. European Journal of Operational Research, 58:284-292, 1992.
5. J. E. Beasley and F. Goffinet. A Delaunay Triangulation-Based Heuristic for the Euclidean Steiner Problem. Networks, 24:215-224, 1994.
6. S. K. Chang. The Generation of Minimal Trees with a Steiner Topology. Journal of the Association for Computing Machinery, 19:699-711, 1972.
7. F. Chapeau-Blondeau, F. Janez, and J.-L. Ferner. A Dynamic Adaptive Relaxation Scheme Applied to the Euclidean Steiner Minimal Tree Problem. SIAM Journal on Optimization, 7(4):1037-1053, 1997.
8. F. K. Hwang. A Linear Time Algorithm for Full Steiner Trees. Operations Research Letters, 4(5):235-237, 1986.
9. F. K. Hwang, D. S. Richards, and P. Winter. The Steiner Tree Problem. Annals of Discrete Mathematics 53. Elsevier, Amsterdam, 1992.
10. D. T. Lee. On k-Nearest Neighbour Voronoi Diagrams in the Plane. IEEE Transactions on Computers, C-31(6):478-487, 1982.
11. D. W. Matula and R. R. Sokal. Properties of Gabriel Graphs Relevant to Geographic Variation Research and the Clustering of Points in the Plane. Geographical Analysis, 12:205-222, 1980.
12. K. Mehlhorn and S. Näher. LEDA - A Platform for Combinatorial and Geometric Computing. Max Planck Institute for Computer Science, Saarbrücken, 1996, http://www.mpi-sb.mpg.de/ LEDA/leda.html.
13. C. H. Papadimitriou and U. V. Vazirani. On Two Geometric Problems Related to the Travelling Salesman Problem. Journal of Algorithms, 5:231-246, 1984.
14. F. P. Preparata and M. I. Shamos. Computational Geometry: An Introduction, second edition. Springer-Verlag, New York, 1988.
15. J. M. Smith, D. T. Lee, and J. S. Liebman. An O (n log n) Heuristic for the Rectilinear Steiner Minimal Tree Problem. Engineering Optimization, 4:179-192, 1980.
16. J. M. Smith, D. T. Lee, and J. S. Liebman. An O (n log n) Heuristic for Steiner Minimal Tree Problems on the Euclidean Metric. Networks, 11:23-29, 1981.
17. J. M. Smith and J. S. Liebman. Steiner Trees, Steiner Circuits and the Interference Problem in Building Design. Engineering Optimization, 4:15-36, 1979.
18. 3. Networks, 25:273-289, 1995.
19. K. J. Supowit. The Relative Neighbourhood Graph, with an Application to Minimum Spanning Trees. Journal of the Association for Computing Machinery, 30(3):428-448, 1983.
20. R. E. Tarjan. Data Structures and Network Algorithms. CBMS-NSF Regional Conference Series in Applied Mathematics, Vol. 44. CBMS, Washington, DC, 1983.
21. E. A. Thompson. The Method of Minimum Evolution. Annals of Human Genetics, 36:333-340, 1973.
22. G. T. Toussaint. The Relative Neighbourhood Graph of a Finite Planar Set. Pattern Recognition, 12(4):261-268, 1980.
23. D. M. Warme. Personal communication, 1997.
24. P. Winter and M. Zachariasen. Euclidean Steiner Minimum Trees: An Improved Exact Algorithm. Networks, 30:149-166, 1997.
25. M. Zachariasen. Local Search for the Steiner Tree Problem in the Euclidean Plane. European Journal of Operational Research, to appear.