✦ LIBER ✦

An optimal algorithm for the Euclidean bottleneck full Steiner tree problem

✍ Scribed by Biniaz, Ahmad; Maheshwari, Anil; Smid, Michiel

Book ID: 122537169
Publisher: Elsevier Science
Year: 2014
Tongue: English
Weight: 172 KB
Volume: 47
Category: Article
ISSN: 0925-7721
DOI: 10.1016/j.comgeo.2013.10.001

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The Euclidean Bottleneck Full Steiner Tr

The Euclidean Bottleneck Full Steiner Tree Problem

✍ Abu-Affash, A. Karim 📂 Article 📅 2013 🏛 Springer 🌐 English ⚖ 555 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

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

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

Two Heuristics for the Euclidean Steiner

Two Heuristics for the Euclidean Steiner Tree Problem

✍ Derek R. Dreyer; Michael L. Overton 📂 Article 📅 1998 🏛 Springer US 🌐 English ⚖ 368 KB

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