✦ LIBER ✦

A polynomial cycle canceling algorithm for submodular flows

✍ Scribed by C. Wallacher; Uwe T. Zimmermann

Publisher: Springer-Verlag
Year: 1999
Tongue: English
Weight: 105 KB
Volume: 86
Category: Article
ISSN: 0025-5610
DOI: 10.1007/s101070050076

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Fast Cycle Canceling Algorithms for Mini

Fast Cycle Canceling Algorithms for Minimum Cost Submodular Flow*

✍ Satoru Iwata†; S.Thomas Mccormick‡; Maiko Shigeno§ 📂 Article 📅 2003 🏛 Springer-Verlag 🌐 English ⚖ 331 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 dual algorithm for submodular flow pro

A dual algorithm for submodular flow problems

✍ Nam-kee Chung; Dong-wan Tcha 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 499 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

A faster strongly polynomial time algori

A faster strongly polynomial time algorithm for submodular function minimization

✍ James B. Orlin 📂 Article 📅 2007 🏛 Springer-Verlag 🌐 English ⚖ 212 KB

Balanced network flows. V. Cycle-canceli

Balanced network flows. V. Cycle-canceling algorithms

✍ Christian Fremuth-Paeger; Dieter Jungnickel 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 161 KB