𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Two probabilistic results on rectilinear steiner trees

✍ Scribed by Marshall W. Bern


Publisher
Springer
Year
1988
Tongue
English
Weight
812 KB
Volume
3
Category
Article
ISSN
0178-4617

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


The Steiner tree problem for terminals o
✍ Siu-Wing Cheng πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 233 KB

Given a simple rectilinear polygon P with k sides and n terminals on its boundary, we present an O(k 3 n)-time algorithm to compute the minimal rectilinear Steiner tree lying inside P interconnecting the terminals. We obtain our result by proving structural properties of a selective set of minimal S