The Steiner Ratio of finite-dimensional Lp-spaces
Starting with the famous book “What is Mathematics” by Courant and Robbins the following problem has been popularized under the name of S t einer : 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 . An updated one can be found in .
KeywordsMinimum Span Tree Steiner Tree Euclidean Plane Steiner Point Isometric Embedding
Unable to display preview. Download preview PDF.
- D. Cieslik, The Steiner Ratio of L p2 3rd Twente Workshop on Graphs and Combinatorial Optimization, eds. U.Faigle and C.Hoede, Universiteit Twente, 1993, Memorandum no 1132, pp. 31–34.Google Scholar
- B.V. Dekster, Simplexes with Prescribed Edge Length in Minkowski and Banach Spaces, Preprint.Google Scholar
- Z. Fiiredi, J. Lagarias, and F. Morgan, Singularities of minimal surfaces and networks and related extremal problems in Minkowski space, DIMA CS Series in Discrete Mathematics and Theoretical Computer Science, (6)1991, pp. 95–106.Google Scholar
- F.K. Hwang, D.S. Richards, and P. Winter, The Steiner Tree Problem, Ann. Discr. Math., (53)1992.Google Scholar
- K. Swanepoel, Combinatorial Geometry of Minkowski Spaces, PhD, University of Pretoria, 1997.Google Scholar