✦ LIBER ✦

Steiner Trees for Terminals Constrained to Curves

✍ Scribed by Rubinstein, J. H.; Thomas, D. A.; Wormald, N. C.

Book ID: 118198923
Publisher: Society for Industrial and Applied Mathematics
Year: 1997
Tongue: English
Weight: 289 KB
Volume: 10
Category: Article
ISSN: 0895-4801
DOI: 10.1137/s0895480192241190

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A polynomial time algorithm for rectilin

A polynomial time algorithm for rectilinear Steiner trees with terminals constrained to curves

✍ Brazil, M.; Thomas, D. A.; Weng, J. F. 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 168 KB 👁 2 views

The rectilinear Steiner problem is the problem of constructing the shortest rectilinear network in the plane connecting a given set of points, called terminals. The problem is known to be NP-complete in general. In this paper, we show that there is a polynomial time algorithm for solving the rectili

Algorithms for terminal Steiner trees

✍ Fábio Viduani Martinez; José Coelho de Pina; José Soares 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 499 KB

Algorithms for degree-constrained Euclid

Algorithms for degree-constrained Euclidean Steiner minimal tree

✍ Jin, Zhang; Liang, Ma; Liantang, Zhang 📂 Article 📅 2008 🏛 Elsevier Science ⚖ 172 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

Algorithms for the minimum diameter term

Algorithms for the minimum diameter terminal Steiner tree problem

✍ Ding, Wei; Qiu, Ke 📂 Article 📅 2013 🏛 Springer US 🌐 English ⚖ 338 KB

An intersecting tree model for odd-diame

An intersecting tree model for odd-diameter-constrained minimum spanning and Steiner trees

✍ Luis Gouveia; Thomas L. Magnanti; Cristina Requejo 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 442 KB