The Steiner Ratio of Metric Spaces

  • Dietmar Cieslik
Part of the Combinatorial Optimization book series (COOP, volume 10)


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 NQ such that the constructed network is of shortest total length. Such network is called a Steiner Minimal Tree (SMT).


Riemannian Manifold Sequence Space Minimum Span Tree Performance Ratio Euclidean Plane 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media Dordrecht 2001

Authors and Affiliations

  • Dietmar Cieslik
    • 1
  1. 1.Institute of Mathematics and C.S.University of GreifswaldGermany

Personalised recommendations