✦ LIBER ✦

On the Single-Source Unsplittable Flow Problem

✍ Scribed by Yefim Dinitz; Naveen Garg; Michel X. Goemans

Publisher: Springer-Verlag
Year: 1999
Tongue: English
Weight: 323 KB
Volume: 19
Category: Article
ISSN: 0209-9683
DOI: 10.1007/s004930050043

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Approximating the single source unsplitt

Approximating the single source unsplittable min-cost flow problem

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

Combinatorial Algorithms for the Unsplit

Combinatorial Algorithms for the Unsplittable Flow Problem

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

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

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

On solving the multi-period single-sourc

On solving the multi-period single-sourcing problem under uncertainty

✍ A. Alonso-Ayuso; L. F. Escudero; C. Pizarro; H. E. Romeijn; D. Romero Morales 📂 Article 📅 2006 🏛 Springer-Verlag 🌐 English ⚖ 197 KB

Upper bounds for single-source uncapacit

Upper bounds for single-source uncapacitated concave minimum-cost network flow problems

✍ Dalila B. M. M. Fontes; Eleni Hadjiconstantinou; Nicos Christofides 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 110 KB