✦ LIBER ✦

An O (log k ) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm

✍ Scribed by Aumann, Yonatan; Rabani, Yuval

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Multicommodity max-flow min-cut theorems

✍ Leighton, Tom; Rao, Satish 📂 Article 📅 1999 🏛 Association for Computing Machinery 🌐 English ⚖ 311 KB

An Approximate Max-Steiner-Tree-Packing

✍ Lap Chi Lau† 📂 Article 📅 2007 🏛 Springer-Verlag 🌐 English ⚖ 349 KB

Max Flow and Min Cut with bounded-length

✍ A. Ridha Mahjoub; S. Thomas McCormick 📂 Article 📅 2010 🏛 Springer-Verlag 🌐 English ⚖ 265 KB

An approximate max-flow min-cut relation

✍ Philip Klein; Satish Rao; Ajit Agrawal; R. Ravi 📂 Article 📅 1995 🏛 Springer-Verlag 🌐 English ⚖ 954 KB

An $O(\log^2{k})$-Approximation Algorith

✍ Fakcharoenphol, Jittat; Laekhanukit, Bundit 📂 Article 📅 2012 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 254 KB

On Approximate Graph Colouring and MAX-k

✍ E. de Klerk; D.V. Pasechnik; J.P. Warners 📂 Article 📅 2004 🏛 Springer US 🌐 English ⚖ 187 KB