✦ LIBER ✦
A monotone iterative procedure to approximate trees of minimal length in metric spaces
✍ Scribed by Dietmar Cieslik
- Publisher
- Elsevier Science
- Year
- 2001
- Tongue
- English
- Weight
- 414 KB
- Volume
- 47
- Category
- Article
- ISSN
- 0362-546X
No coin nor oath required. For personal study only.
✦ Synopsis
Let (N) be a finite set of points in a metric space. The problem of "Shortest Connectivity" search a Steiner-Minimal-Tree (SMT) for (N), which is a tree interconnecting the points of (N) with shortest possible length. Here, we allow additional points (Steiner points) in the tree. In general, it is very hard to find an SMT, as well in sense of geometry as in the sense of computational complexity. For many metric spaces methods to construct an SMT are still unknown.