Abstract
Remember Steiner’s Problem: Given a finite set N of “fixed” points in a metric space (X, ρ), look for a set Q of “moving” points1 and a set of edges interconnecting the union set N ∪ Q such that the constructed network is of shortest total length. Such network is called a Steiner Minimal Tree (SMT).
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
© 2001 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Cieslik, D. (2001). The Steiner Ratio of Metric Spaces. In: The Steiner Ratio. Combinatorial Optimization, vol 10. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-6798-8_4
Download citation
DOI: https://doi.org/10.1007/978-1-4757-6798-8_4
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-4856-4
Online ISBN: 978-1-4757-6798-8
eBook Packages: Springer Book Archive