Steiner Minimal Trees in Rectilinear and Octilinear Planes
β Scribed by Song Pu Shang; Tong Jing
- Publisher
- Institute of Mathematics, Chinese Academy of Sciences and Chinese Mathematical Society
- Year
- 2007
- Tongue
- English
- Weight
- 299 KB
- Volume
- 23
- Category
- Article
- ISSN
- 1439-7617
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
A Steiner minimum tree SMT in the rectilinear plane is the shortest length tree interconnecting a set of points, called the regular points, possibly using Ε½ . additional vertices. A k-size Steiner minimum tree kSMT is one that can be split into components where all regular points are leaves and all
For a finite set of points in a metric space a Steiner Minimal Tree (SMT) is a shortest tree which interconnects these points. We also consider a relative of this problem allowing at most k additional points in the tree (k-SMT), where k is a given number. We intend to discuss these problems for all