✦ LIBER ✦

Bottleneck Steiner trees in the plane

✍ Scribed by Sarrafzadeh, M.; Wong, C.K.

Book ID: 119771805
Publisher: IEEE
Year: 1992
Tongue: English
Weight: 532 KB
Volume: 41
Category: Article
ISSN: 0018-9340
DOI: 10.1109/12.127452

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

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

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

On-line steiner trees in the Euclidean p

On-line steiner trees in the Euclidean plane

✍ Noga Alon; Yossi Azar 📂 Article 📅 1993 🏛 Springer 🌐 English ⚖ 485 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