Abstract
Consider an undirected graph G, each of its edges is labeled with a distance. Let S be a specified subset of nodes of G. The Steiner tree problem is to find a tree of G that spans S with minimal total distance on its edges. The nodes in the set S are called Steiner points.
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.
Bibliographic Notes
The Steiner tree heuristic algorithm comes from L. Kou, G. Markowsky and L. Berman, “A fast algorithm for Steiner trees”, Research Report RC 7390, IBM Thomas J. Watson Research Center, Yorktown Heights, New York, 1978.
The shortest path algorithm originates from E. W. Dijkstra, “A note on two problems in connexion with graphs”, Numerische Mathematik 1(1959), 269–271.
The minimum spanning tree algorithm follows from R. C. Prim, “Shortest connection networks and some generalizations”, Bell System Technical Journal 36(1957), 1389–1401.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1986 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Lau, H.T. (1986). Steiner Tree Problem. In: Combinatorial Heuristic Algorithms with FORTRAN. Lecture Notes in Economics and Mathematical Systems, vol 280. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-61649-5_5
Download citation
DOI: https://doi.org/10.1007/978-3-642-61649-5_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-17161-4
Online ISBN: 978-3-642-61649-5
eBook Packages: Springer Book Archive