✦ LIBER ✦

Two new criteria for finding Steiner hulls in Steiner tree problems

✍ Scribed by J. Scott Provan

Book ID: 105301243
Publisher: Springer
Year: 1992
Tongue: English
Weight: 815 KB
Volume: 7
Category: Article
ISSN: 0178-4617
DOI: 10.1007/bf01758763

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

New geometry-inspired relaxations and al

New geometry-inspired relaxations and algorithms for the metric Steiner tree problem

✍ Deeparnab Chakrabarty; Nikhil R. Devanur; Vijay V. Vazirani 📂 Article 📅 2009 🏛 Springer-Verlag 🌐 English ⚖ 550 KB

An approximation scheme for some Steiner

An approximation scheme for some Steiner tree problems in the plane

✍ Wang, Lusheng; Jiang, Tao 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 536 KB

We design a polynomial-time approximation scheme for the Steiner tree problem in the plane when the given set of regular points is c-local, i.e., in the minimum-cost spanning tree for the given set of regular points, the length of the longest edge is at most c times the length of the shortest edge.

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

A faster approximation algorithm for the

A faster approximation algorithm for the steiner tree problem in graphs

✍ Alexander Z. Zelikovsky 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 369 KB

A lower bound for the steiner tree probl

A lower bound for the steiner tree problem in directed graphs

✍ Weiguo Liu 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 593 KB