𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Steiner trees, partial 2–trees, and minimum IFI networks

✍ Scribed by Joseph A. Wald; Charles J. Colbourn


Publisher
John Wiley and Sons
Year
1983
Tongue
English
Weight
529 KB
Volume
13
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.


📜 SIMILAR VOLUMES


Euclidean Steiner minimum trees: An impr
✍ Winter, Pawel; Zachariasen, Martin 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 296 KB

The Euclidean Steiner tree problem asks for a shortest network interconnecting a set of terminals in the plane. Over the last decade, the maximum problem size solvable within 1 h (for randomly generated problem instances) has increased from 10 to approximately 50 terminals. We present a new exact al

Faster exact algorithms for steiner tree
✍ Marshall Bern 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 739 KB

We improve the time and space complexities of dynamic programming algorithms that compute optimal Steiner trees spanning nodes in planar networks. Our algorithms have special application to the rectilinear Steiner problem.