The Steiner Ratio of Metric Spaces
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).
KeywordsRiemannian Manifold Sequence Space Minimum Span Tree Performance Ratio Euclidean Plane
Unable to display preview. Download preview PDF.