Steiner Minimal Trees
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...
| Main Author: | |
|---|---|
| Format: | eBook |
| Language: | English |
| Published: |
New York, NY
Springer US
1998, 1998
|
| Edition: | 1st ed. 1998 |
| Series: | Nonconvex Optimization and Its Applications
|
| Subjects: | |
| Online Access: | |
| Collection: | Springer Book Archives -2004 - Collection details see MPG.ReNa |
Table of Contents:
- 1 Introduction
- 2 SMT and MST in Metric Spaces — A Survey
- 3 Fermat’s Problem in Banach-Minkowski Spaces
- 4 The Degrees of the Vertices in Shortest Trees
- 5 1-Steiner-Minimal-Trees
- 6 Methods to Construct Shortest Trees
- 7 The Steiner Ratio of Banach-Minkowski Spaces
- 8 Generalizations
- References