✦ LIBER ✦

A series of approximation algorithms for the acyclic directed steiner tree problem

✍ Scribed by A. Zelikovsky

Book ID: 110547542
Publisher: Springer
Year: 1997
Tongue: English
Weight: 739 KB
Volume: 18
Category: Article
ISSN: 0178-4617
DOI: 10.1007/bf02523690

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

A Polylogarithmic Approximation Algorith

A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem

✍ Naveen Garg; Goran Konjevod; R. Ravi 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 130 KB

The group Steiner tree problem is a generalization of the Steiner tree problem where we are given several subsets (groups) of vertices in a weighted graph, and the goal is to find a minimum-weight connected subgraph containing at least one vertex from each group.The problem was introduced by Reich a

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

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

On efficient implementation of an approx

On efficient implementation of an approximation algorithm for the Steiner tree problem

✍ Lawrence T. Kou 📂 Article 📅 1990 🏛 Springer-Verlag 🌐 English ⚖ 689 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