𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Dynamic Programming for Minimum Steiner Trees

✍ Scribed by B. Fuchs; W. Kern; D. Molle; S. Richter; P. Rossmanith; X. Wang


Publisher
Springer
Year
2007
Tongue
English
Weight
180 KB
Volume
41
Category
Article
ISSN
1433-0490

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Minimum steiner trees in normed planes
✍ Ding-Zhu Du; Biao Gao; Ronald L. Graham; Zi-Cheng Liu; Peng-Jun Wan πŸ“‚ Article πŸ“… 1993 πŸ› Springer 🌐 English βš– 926 KB
Delay-related secondary objectives for r
✍ Sven Peyer; Martin Zachariasen; David Grove JΓΈrgensen πŸ“‚ Article πŸ“… 2004 πŸ› Elsevier Science 🌐 English βš– 759 KB

The rectilinear Steiner tree problem in the plane is to construct a minimum-length tree interconnecting a set of points (called terminals) consisting of horizontal and vertical line segments only. Rectilinear Steiner minimum trees (RSMTs) can today be computed quickly for realistic instances occurri