𝔖 Bobbio Scriptorium
✦   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

No coin nor oath required. For personal study only.


📜 SIMILAR VOLUMES


A Polylogarithmic Approximation Algorith
✍ 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