✦ 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
DOI: 10.1007/s00224-007-1324-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On greedy heuristics for steiner minimum

On greedy heuristics for steiner minimum trees

✍ Ding -Zhu Du 📂 Article 📅 1995 🏛 Springer 🌐 English ⚖ 249 KB

On better heuristics for Steiner minimum

On better heuristics for Steiner minimum trees

✍ Ding-Zhu Du; Yanjun Zhang 📂 Article 📅 1992 🏛 Springer-Verlag 🌐 English ⚖ 519 KB

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

Steiner trees, partial 2–trees, and mini

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

✍ Joseph A. Wald; Charles J. Colbourn 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 529 KB

Steiner trees, partial 2–trees, and mini

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

✍ Joseph A. Wald; Charles J. Colbourn 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 529 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