✦ LIBER ✦

Algorithms for the minimum diameter terminal Steiner tree problem

✍ Scribed by Ding, Wei; Qiu, Ke

Book ID: 120694246
Publisher: Springer US
Year: 2013
Tongue: English
Weight: 338 KB
Volume: 28
Category: Article
ISSN: 1382-6905
DOI: 10.1007/s10878-012-9591-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Algorithms for terminal Steiner trees

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

On the terminal Steiner tree problem

✍ Guohui Lin; Guoliang Xue 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 69 KB

We investigate a practical variant of the well-known graph Steiner tree problem. In this variant, every target vertex is required to be a leaf vertex in the solution Steiner tree. We present hardness results for this variant as well as a polynomial time approximation algorithm with performance ratio

Exact Algorithms for the Bottleneck Stei

Exact Algorithms for the Bottleneck Steiner Tree Problem

✍ Sang Won Bae; Sunghee Choi; Chunseok Lee; Shin-ichi Tanigawa 📂 Article 📅 2011 🏛 Springer 🌐 English ⚖ 907 KB

New algorithms for the rectilinear Stein

New algorithms for the rectilinear Steiner tree problem

✍ Ho, J.-M.; Vijayan, G.; Wong, C.K. 📂 Article 📅 1990 🏛 IEEE 🌐 English ⚖ 1000 KB

A practical algorithm for the minimum re

A practical algorithm for the minimum rectilinear steiner tree

✍ Jun Ma; Bo Yang; Shaohan Ma 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 288 KB

On the partial terminal Steiner tree pro

On the partial terminal Steiner tree problem

✍ Sun-Yuan Hsieh; Huang-Ming Gao 📂 Article 📅 2007 🏛 Springer US 🌐 English ⚖ 333 KB