Methods to Construct Shortest Trees

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


In the chapters before, we described the combinatorial structure of shortest trees; and we investigated a local solution to determine the locus of the Steiner points in relation to its neighbors. The purpose of this chapter is to create methods which find solutions of Steiner’s Problem and its relatives in general. It will not be possible to develop an exact solution method working in all Banach-Minkowski spaces or at least in all planes.1 At first we have to define what “solve” means. We will find several strategies to solve Steiner’s Problem in specific spaces. Moreover, we will describe methods to construct shortest trees in classes of Banach-Minkowski planes and in some higher dimensional spaces, too. On the other hand, we will investigate heuristics and approximations.


Convex Hull Unit Ball Planar Graph Minimum Span Tree Voronoi Diagram 
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 1998

Authors and Affiliations

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

Personalised recommendations