๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Approximation algorithms for spanner problems and Directed Steiner Forest

โœ Scribed by Piotr Berman; Arnab Bhattacharyya; Konstantin Makarychev; Sofya Raskhodnikova; Grigory Yaroslavtsev

Book ID
119257790
Publisher
Elsevier Science
Year
2013
Tongue
English
Weight
307 KB
Volume
222
Category
Article
ISSN
0890-5401

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Approximation Algorithms for Directed St
Approximation Algorithms for Directed Steiner Problems
โœ Moses Charikar; Chandra Chekuri; To-yat Cheung; Zuo Dai; Ashish Goel; Sudipto Gu ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 181 KB

We give the first non-trivial approximation algorithms for the Steiner tree problem and the generalized Steiner network problem on general directed graphs. These problems have several applications in network design and multicast routing.

Approximation Algorithms for Steiner and
Approximation Algorithms for Steiner and Directed Multicuts
โœ Philip N Klein; Serge A Plotkin; Satish Rao; ร‰va Tardos ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 277 KB

In this paper we consider the Steiner multicut problem. This is a generalization of the minimum multicut problem where instead of separating node pairs, the goal is to find a minimum weight set of edges that separates all given sets of nodes. A set is considered separated if it is not contained in a