Abstract
Let (X, ρ) be a metric space, and let (X′, ρ′) be a metric space that is “close” to (X, ρ). Then we may expect that a method to find a shortest tree in (X, ρ) can be extended to an approximate method in (X′, ρ′), and consequently, the Steiner ratios of the two spaces are not far from another. This is the main idea in the present chapter.
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
© 2001 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Cieslik, D. (2001). The Steiner Ratio of Neighboured Spaces. In: The Steiner Ratio. Combinatorial Optimization, vol 10. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-6798-8_7
Download citation
DOI: https://doi.org/10.1007/978-1-4757-6798-8_7
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-4856-4
Online ISBN: 978-1-4757-6798-8
eBook Packages: Springer Book Archive