✦ LIBER ✦

Approximating the single source unsplittable min-cost flow problem

✍ Scribed by Martin Skutella

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the Single-Source Unsplittable Flow P

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

Approximation Algorithms for the Unsplit

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

Single-source k-splittable min-cost flow

✍ Fernanda Salazar; Martin Skutella 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 678 KB

An algorithm for the min concave cost fl

✍ Giorgio Gallo; Claudio Sandi; Claudio Sodini 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 696 KB

Upper bounds for single-source uncapacit

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

The Minimum Concave Cost Network Flow Pr

✍ Hoang Tuy; Saied Ghannadan; Athanasios Migdalas; Peter Värbrand 📂 Article 📅 1995 🏛 Springer US 🌐 English ⚖ 856 KB