Abstract
The Steiner Problem in Networks deals with finite objects only. So, in principle, the problem can easily be solved: just enumerate all subsets of the edges, check whether they form a Steiner tree which span the given terminal set, and keep the smallest one. Although such an approach leads to a finite algorithm, it is certainly not a very efficient one. Its complexity is exponential in the number of edges of the network. On the other hand, as we have seen in Chapter 3, so far there is no polynomial time algorithm known for the Steiner Problem in Graphs and, hence, in particular none for the Steiner Problem in Networks.
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.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2002 Friedr. Vieweg & Sohn Verlagsgesellschaft mbH, Braunschweig/Wiesbaden
About this chapter
Cite this chapter
Prömel, H.J., Steger, A. (2002). Exact Algorithms. In: The Steiner Tree Problem. Advanced Lectures in Mathematics. Vieweg+Teubner Verlag. https://doi.org/10.1007/978-3-322-80291-0_5
Download citation
DOI: https://doi.org/10.1007/978-3-322-80291-0_5
Publisher Name: Vieweg+Teubner Verlag
Print ISBN: 978-3-528-06762-5
Online ISBN: 978-3-322-80291-0
eBook Packages: Springer Book Archive