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

Approximation Algorithms for Single-Source Unsplittable Flow

โœ Scribed by Kolliopoulos, Stavros G.; Stein, Clifford


Book ID
118180481
Publisher
Society for Industrial and Applied Mathematics
Year
2001
Tongue
English
Weight
305 KB
Volume
31
Category
Article
ISSN
0097-5397

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


A note on the greedy algorithm for the u
โœ Petr Kolman ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 161 KB

In a recent paper Chekuri and Khanna improved the analysis of the greedy algorithm for the edge disjoint paths problem and proved the same bounds also for the related uniform capacity unsplittable flow problem. Here we show that their ideas can be used to get the same approximation ratio even for th