Shortest Trees in Metric Spaces — A Survey

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


Here, we describe several basic facts about the combinatorial and geometrical structure of shortest trees, that means k-SMT’s, where k is a nonnegative integer or k = ∞. Most of these results will play an important role in determining or estimating the Steiner ratio.


Short Path Convex Hull Span Tree Unit Ball Short Tree 
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