✦ LIBER ✦

A Survey of Parallel and Distributed Algorithms for the Steiner Tree Problem

✍ Scribed by Bezenšek, Mitja; Robič, Borut

Book ID: 121545196
Publisher: Springer
Year: 2013
Tongue: English
Weight: 440 KB
Volume: 42
Category: Article
ISSN: 1573-7640
DOI: 10.1007/s10766-013-0243-z

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Distributed Heuristic Algorithm for th

A Distributed Heuristic Algorithm for the Rectilinear Steiner Minimal Tree Problem

✍ Cinel, S.; Bazlamacci, C.F. 📂 Article 📅 2008 🏛 IEEE 🌐 English ⚖ 188 KB

A survey of parallel distributed genetic

A survey of parallel distributed genetic algorithms

✍ Enrique Alba; José M. Troya 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 650 KB

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 series of approximation algorithms for

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

✍ A. Zelikovsky 📂 Article 📅 1997 🏛 Springer 🌐 English ⚖ 739 KB

A survey of checkpointing algorithms for

A survey of checkpointing algorithms for parallel and distributed computers

✍ S. Kalaiselvi; V. Rajaraman 📂 Article 📅 2000 🏛 Indian Academy of Sciences 🌐 English ⚖ 167 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