✦ LIBER ✦

A Strongly Polynomial Cut Canceling Algorithm for Minimum Cost Submodular Flow

✍ Scribed by Iwata, Satoru; McCormick, S. Thomas; Shigeno, Maiko

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Fast Cycle Canceling Algorithms for Mini

✍ Satoru Iwata†; S.Thomas Mccormick‡; Maiko Shigeno§ 📂 Article 📅 2003 🏛 Springer-Verlag 🌐 English ⚖ 331 KB

A polynomial cycle canceling algorithm f

✍ C. Wallacher; Uwe T. Zimmermann 📂 Article 📅 1999 🏛 Springer-Verlag 🌐 English ⚖ 105 KB

A strongly polynomial minimum cost circu

✍ Éva Tardos 📂 Article 📅 1985 🏛 Springer-Verlag 🌐 English ⚖ 459 KB

New polynomial-time cycle-canceling algo

✍ P. T. Sokkalingam; Ravindra K. Ahuja; James B. Orlin 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 227 KB

A faster capacity scaling algorithm for

✍ Lisa Fleischer; Satoru Iwata; S. Thomas McCormick 📂 Article 📅 2002 🏛 Springer-Verlag 🌐 English ⚖ 217 KB

A polynomial algorithm for minimum quadr

✍ M. Minoux 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 739 KB