Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
R. Ahuja, T. Magnanti, and J. Orlin. Network Flows: Theory, algorithms, and applications. Prentice-Hall, 1993.
C. Duin and S. Voss. The Pilot method: A strategy for heuristic repetition with application to the Steiner problem in graphs. Networks, 34:181–191, 1999.
F. Hwang, D. Richards, and P. Winter. The Steiner tree problem, volume 53 of Annals of Discrete Mathematics. North-Holland, Amsterdam, 1992.
T. Koch and A. Martin. Solving Steiner tree problems in graphs to optimality. Networks, 32:207–232, 1998.
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.
K. Melhorn. A faster approximation algorithm for the Steiner problem in graphs. Information Processing Letters, 27:125–128, 1988.
B. M. E. Moret and H. D. Shapiro. An empirical assessment of algorithms for constructing a minimum spanning tree. DIMACS Monographs in Discrete Mathematics and Theoretical Computer Science, 15:99–117, 1994.
T. Polzin and S. V. Daneshmand. Improved algorithms for the Steiner problem in networks. Discrete Applied Mathematics, 112(1–3):263–300, 2001.
F. P. Preparata and M. I. Shamos. Computational Geometry: An Introduction. Springer-Verlag, 1985.
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.
H. Takahashi and A. Matsuyama. An approximate solution for the Steiner problem in graphs. Math. Japonica, 24:573–577, 1980.
S. Voss. Steiner’s problem in graphs: Heuristic methods. Discrete Applied Mathematics, 40:45–72, 1992.
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.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
de Aragão, M.P., Werneck, R.F. (2002). On the Implementation of MST-Based Heuristics for the Steiner Problem in Graphs. In: Mount, D.M., Stein, C. (eds) Algorithm Engineering and Experiments. ALENEX 2002. Lecture Notes in Computer Science, vol 2409. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45643-0_1
Download citation
DOI: https://doi.org/10.1007/3-540-45643-0_1
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43977-6
Online ISBN: 978-3-540-45643-8
eBook Packages: Springer Book Archive