✦ LIBER ✦

Max Flow and Min Cut with bounded-length paths: complexity, algorithms, and approximation

✍ Scribed by A. Ridha Mahjoub; S. Thomas McCormick

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Examples of max-flow and min-cut problem

✍ Ryôhei Nozawa 📂 Article 📅 1994 🏛 Springer-Verlag 🌐 English ⚖ 968 KB

A strong bound on the integral of the ce

✍ Renato D. C. Monteiro; Takashi Tsuchiya 📂 Article 📅 2007 🏛 Springer-Verlag 🌐 English ⚖ 673 KB