The Steiner Ratio of L p -planes

Jens Albrecht () and Dietmar Cieslik ()
Additional contact information
Jens Albrecht: University of Greifswald, Institute of Mathematics and Computer Science
Dietmar Cieslik: University of Greifswald, Institute of Mathematics and Computer Science

A chapter in Handbook of Combinatorial Optimization, 1999, pp 573-589 from Springer

Abstract: Abstract Starting with the famous book ”What is Mathematics” by Courant and Robbins the following problem has been popularized under the name of Steiner: For a given finite set of points in a metric space find a network which connects all points of the set with minimal length. Such a network must be a tree, which is called a Steiner Minimal Tree (SMT). It may contain vertices other than the points which are to be connected. Such points are called Steiner points.1 A classical survey of this problem in the Euclidean plane was given by Gilbert and Pollak [23]. An updated one can be found in [27].

Keywords: Unit Ball; Minimum Span Tree; Euclidean Plane; Steiner Point; Steiner Tree Problem (search for similar items in EconPapers)
Date: 1999
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4757-3023-4_8

Ordering information: This item can be ordered from
http://www.springer.com/9781475730234

DOI: 10.1007/978-1-4757-3023-4_8

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().