✦ LIBER ✦

Algorithms for degree-constrained Euclidean Steiner minimal tree

✍ Scribed by Jin, Zhang; Liang, Ma; Liantang, Zhang

Book ID: 123446460
Publisher: Elsevier Science
Year: 2008
Weight: 172 KB
Volume: 19
Category: Article
ISSN: 1004-4132
DOI: 10.1016/S1004-4132(08)60146-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An improved algorithm for computing Stei

An improved algorithm for computing Steiner minimal trees in Euclidean -space

✍ Marcia Fampa; Kurt M. Anstreicher 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 463 KB

A NEW BOUND FOR EUCLIDEAN STEINER MINIMA

A NEW BOUND FOR EUCLIDEAN STEINER MINIMAL TREES

✍ F. R. K. Chung; R. L. Graham 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 572 KB

A decomposition theorem on Euclidean Ste

A decomposition theorem on Euclidean Steiner minimal trees

✍ F. K. Hwang; G. D. Song; G. Y. Ting; D. Z. Du 📂 Article 📅 1988 🏛 Springer 🌐 English ⚖ 623 KB

Approximation Algorithms for Constrained

Approximation Algorithms for Constrained Node Weighted Steiner Tree Problems

✍ Moss, A.; Rabani, Y. 📂 Article 📅 2007 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 241 KB

Euclidean Steiner minimum trees: An impr

Euclidean Steiner minimum trees: An improved exact algorithm

✍ 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

Approximation algorithm for bottleneck S

Approximation algorithm for bottleneck Steiner tree problem in the Euclidean plane

✍ Zi-Mao Li; Da-Ming Zhu; Shao-Han Ma 📂 Article 📅 2004 🏛 Springer 🌐 English ⚖ 339 KB