✦ LIBER ✦

Approximations for a Bottleneck Steiner Tree Problem

✍ Scribed by L. Wang and D. -Z. Du

Book ID: 120136528
Publisher: Springer
Year: 2002
Tongue: English
Weight: 79 KB
Volume: 32
Category: Article
ISSN: 0178-4617
DOI: 10.1007/s00453-001-0089-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An approximation algorithm for a bottlen

An approximation algorithm for a bottleneck k-Steiner tree problem in the Euclidean plane

✍ Lusheng Wang; Zimao Li 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 95 KB

We study a bottleneck Steiner tree problem: given a set P = {p 1 , p 2 , . . . , p n } of n terminals in the Euclidean plane and a positive integer k, find a Steiner tree with at most k Steiner points such that the length of the longest edges in the tree is minimized. The problem has applications in

Optimal and approximate bottleneck Stein

Optimal and approximate bottleneck Steiner trees

✍ Joseph L. Ganley; Jeffrey S. Salowe 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 617 KB

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

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

The Euclidean Bottleneck Full Steiner Tr

The Euclidean Bottleneck Full Steiner Tree Problem

✍ Abu-Affash, A. Karim 📂 Article 📅 2013 🏛 Springer 🌐 English ⚖ 555 KB

The internal Steiner tree problem: Hardn

The internal Steiner tree problem: Hardness and approximations

✍ Huang, Chao-Wen; Lee, Chia-Wei; Gao, Huang-Ming; Hsieh, Sun-Yuan 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 834 KB