A Strongly Polynomial Cut Canceling Algorithm for the Submodular Flow Problem

Satoru Iwata, S. Thomas McCormick, Maiko Shigeno. A Strongly Polynomial Cut Canceling Algorithm for the Submodular Flow Problem. In Gérard Cornuéjols, Rainer E. Burkard, Gerhard J. Woeginger, editors, Integer Programming and Combinatorial Optimization, 7th International IPCO Conference, Graz, Austria, June 9-11, 1999, Proceedings. Volume 1610 of Lecture Notes in Computer Science, pages 259-272, Springer, 1999. [doi]

Abstract

Abstract is missing.