Advertisement

Steiner Minimal Trees

  • Dietmar Cieslik

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

Table of contents

  1. Front Matter
    Pages i-xi
  2. Dietmar Cieslik
    Pages 1-48
  3. Dietmar Cieslik
    Pages 49-90
  4. Dietmar Cieslik
    Pages 91-123
  5. Dietmar Cieslik
    Pages 125-162
  6. Dietmar Cieslik
    Pages 163-175
  7. Dietmar Cieslik
    Pages 177-233
  8. Dietmar Cieslik
    Pages 235-269
  9. Dietmar Cieslik
    Pages 271-285
  10. Back Matter
    Pages 287-322

About this book

Introduction

The problem of "Shortest Connectivity", which is discussed here, has a long and convoluted history. Many scientists from many fields as well as laymen have stepped on its stage. Usually, the problem is known as Steiner's Problem and it can be described more precisely in the following way: Given a finite set of points in a metric space, search for a network that connects these points with the shortest possible length. This shortest network must be a tree and is called a Steiner Minimal Tree (SMT). It may contain vertices different from the points which are to be connected. Such points are called Steiner points. Steiner's Problem seems disarmingly simple, but it is rich with possibilities and difficulties, even in the simplest case, the Euclidean plane. This is one of the reasons that an enormous volume of literature has been published, starting in 1 the seventeenth century and continuing until today. The difficulty is that we look for the shortest network overall. Minimum span­ ning networks have been well-studied and solved eompletely in the case where only the given points must be connected. The novelty of Steiner's Problem is that new points, the Steiner points, may be introduced so that an intercon­ necting network of all these points will be shorter. This also shows that it is impossible to solve the problem with combinatorial and geometric methods alone.

Keywords

Graph theory Mathematica calculus computer computer science geometry linear optimization network networks optimization theoretical computer science vertices

Authors and affiliations

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

Bibliographic information

  • DOI https://doi.org/10.1007/978-1-4757-6585-4
  • Copyright Information Springer-Verlag US 1998
  • Publisher Name Springer, Boston, MA
  • eBook Packages Springer Book Archive
  • Print ISBN 978-1-4419-4790-1
  • Online ISBN 978-1-4757-6585-4
  • Series Print ISSN 1571-568X
  • Buy this book on publisher's site
Industry Sectors
IT & Software
Energy, Utilities & Environment
Engineering