On the Implementation of MST-Based Heuristics for the Steiner Problem in Graphs
Some of the most widely used constructive heuristics for the Steiner Problem in Graphs are based on algorithms for the Minimum Spanning Tree problem. In this paper, we examine efficient implementations of heuristics based on the classic algorithms by Prim, Kruskal, and Borůvka. An extensive experimental study indicates that the theoretical worst-case complexity of the algorithms give little information about their behavior in practice. Careful implementation improves average computation times not only significantly, but asymptotically. Running times for our implementations are within a small constant factor from that of Prim’s algorithm for the Minimum Spanning Tree problem, suggesting that there is little room for improvement.
KeywordsShort Path Voronoi Diagram Partial Solution Steiner Tree Steiner Tree Problem
Unable to display preview. Download preview PDF.
- 1.R. Ahuja, T. Magnanti, and J. Orlin. Network Flows: Theory, algorithms, and applications. Prentice-Hall, 1993.Google Scholar
- 5.T. Koch, A. Martin, and S. Voss. SteinLib: An updated library on Steiner tree problems in graphs. Technical Report ZIB-Report 00-37, Konrad-Zuse-Zentrum für Informationstechnik Berlin, 2000. http://elib.zib.de/steinlib.
- 9.F. P. Preparata and M. I. Shamos. Computational Geometry: An Introduction. Springer-Verlag, 1985.Google Scholar
- 10.C. C. Ribeiro, E. Uchoa, and R. F. Werneck. A hybrid GRASP with perturbations for the Steiner problem in graphs. INFORMS Journal on Computing, to appear.Google Scholar
- 13.S.M. Wang. A multiple source algorithm for suboptimum Steiner trees in graphs. In H. Noltemeier, editor, Proceedings of the International Workshop on Graph-Theoretic Concepts in Computer Science, pages 387–396. Würzburg, 1985.Google Scholar