✦ LIBER ✦

Fast Cycle Canceling Algorithms for Minimum Cost Submodular Flow*

✍ Scribed by Satoru Iwata†; S.Thomas Mccormick‡; Maiko Shigeno§

Publisher: Springer-Verlag
Year: 2003
Tongue: English
Weight: 331 KB
Volume: 23
Category: Article
ISSN: 0209-9683
DOI: 10.1007/s00493-003-0030-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A polynomial cycle canceling algorithm f

A polynomial cycle canceling algorithm for submodular flows

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

New polynomial-time cycle-canceling algo

New polynomial-time cycle-canceling algorithms for minimum-cost flows

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

A faster capacity scaling algorithm for

A faster capacity scaling algorithm for minimum cost submodular flow

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

Canceling most helpful total cuts for mi

Canceling most helpful total cuts for minimum cost network flow

✍ Thomas R. Ervolina; S. Thomas McCormick 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 876 KB

A cost-scaling algorithm for 0–1 submodu

A cost-scaling algorithm for 0–1 submodular flows

✍ Maiko Shigeno; Satoru Iwata 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 820 KB

This paper presents a cost-scaling algorithm for minimum cost O-l submodular flows. The algorithm works by splitting the arc costs approximately and maintaining an optimal submodular pseudoflow with respect to the split costs obtained by a greedy algorithm. Each scaling phase of the algorithm is a h

Minimum cost flow algorithms for series-

Minimum cost flow algorithms for series-parallel networks

✍ Wolfgang W. Bein; Peter Brucker; Arie Tamir 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 439 KB