✦ LIBER ✦

Exact Algorithms for the Bottleneck Steiner Tree Problem

✍ Scribed by Sang Won Bae; Sunghee Choi; Chunseok Lee; Shin-ichi Tanigawa

Publisher: Springer
Year: 2011
Tongue: English
Weight: 907 KB
Volume: 61
Category: Article
ISSN: 0178-4617
DOI: 10.1007/s00453-011-9553-y

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 exact algorithm for the node weighted

An exact algorithm for the node weighted Steiner tree problem

✍ Roberto Cordone; Marco Trubian 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 134 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

Faster Approximation Algorithms for the

Faster Approximation Algorithms for the Rectilinear Steiner Tree Problem

✍ U. Fößmeier; M. Kaufmann; A. Zelikovsky 📂 Article 📅 1997 🏛 Springer 🌐 English ⚖ 217 KB

An Algorithmic Framework for the Exact S

An Algorithmic Framework for the Exact Solution of the Prize-Collecting Steiner Tree Problem

✍ Ivana Ljubić; René Weiskircher; Ulrich Pferschy; Gunnar W. Klau; Petra Mutzel; M 📂 Article 📅 2005 🏛 Springer-Verlag 🌐 English ⚖ 369 KB

Faster exact algorithms for steiner tree

Faster exact algorithms for steiner trees in planar networks

✍ Marshall Bern 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 739 KB

We improve the time and space complexities of dynamic programming algorithms that compute optimal Steiner trees spanning nodes in planar networks. Our algorithms have special application to the rectilinear Steiner problem.