✦ 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
DOI: 10.1137/s0097539799355314

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Approximation Algorithms for the Unsplit

Approximation Algorithms for the Unsplittable Flow Problem

✍ Amit Chakrabarti; Chandra Chekuri; Anupam Gupta; Amit Kumar 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 270 KB

Approximating the single source unsplitt

Approximating the single source unsplittable min-cost flow problem

✍ Martin Skutella 📂 Article 📅 2002 🏛 Springer-Verlag 🌐 English ⚖ 312 KB

On the Single-Source Unsplittable Flow P

On the Single-Source Unsplittable Flow Problem

✍ Yefim Dinitz; Naveen Garg; Michel X. Goemans 📂 Article 📅 1999 🏛 Springer-Verlag 🌐 English ⚖ 323 KB

Combinatorial Algorithms for the Unsplit

Combinatorial Algorithms for the Unsplittable Flow Problem

✍ Yossi Azar; Oded Regev 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 311 KB

A note on the greedy algorithm for the u

A note on the greedy algorithm for the unsplittable flow problem

✍ 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

NP-Hardness of Broadcast Scheduling and

NP-Hardness of Broadcast Scheduling and Inapproximability of Single-Source Unsplittable Min-Cost Flow

✍ Thomas Erlebach; Alexander Hall 📂 Article 📅 2004 🏛 Springer US 🌐 English ⚖ 214 KB