Networks, Spaces and Algorithms

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

Abstract

The main subject of this book is the Steiner ratio in metric spaces. We will use many basic definitions and facts related to the theory of metric spaces. Moreover, we have to consider networks as the solutions of Steiner’s Problem. Finally, we are interested in algorithmic methods to determine shortest trees. Hence, we have to discuss the terminology of algorithms. Most of the definitions about networks, spaces and algorithms are quoted in this chapter. All proofs are omitted.

Keywords

Span Tree Unit Ball Connected Graph Minimum Span Tree Steiner Point 
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 2001

Authors and Affiliations

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

Personalised recommendations