1-Steiner-Minimal-Trees

  • Dietmar Cieslik
Part of the Nonconvex Optimization and Its Applications book series (NOIA, volume 23)

Abstract

Whereas an MST can be found easily, the determination of an SMT is still unknown for some metric spaces; in most of the cases, it needs exponential time, and only in few special spaces1 it is an easy problem. On the other hand, an MST is often a bad approximation of an SMT; that means the Steiner Ratio is much smaller than one.

Keywords

Minimum Span Tree Short Tree Euclidean Plane Steiner Point Minkowski 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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media Dordrecht 1998

Authors and Affiliations

  • Dietmar Cieslik
    • 1
  1. 1.Ernst-Moritz-Arndt UniversityGreifswaldGermany

Personalised recommendations