Abstract
In Chapter 3 we have seen that the Steiner problem in networks is 𝒩𝒫-complete. It is thus unlikely that there exists an efficient (polynomial time) algorithm for its solution.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
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). Approximation Algorithms. In: The Steiner Tree Problem. Advanced Lectures in Mathematics. Vieweg+Teubner Verlag. https://doi.org/10.1007/978-3-322-80291-0_6
Download citation
DOI: https://doi.org/10.1007/978-3-322-80291-0_6
Publisher Name: Vieweg+Teubner Verlag
Print ISBN: 978-3-528-06762-5
Online ISBN: 978-3-322-80291-0
eBook Packages: Springer Book Archive