A faster algorithm for minimum cost submodular flows

Authors:
Satoru Iwata;S. Thomas McCormick;Maiko Shigeno
Affiliations:
Division of Systems Science, Graduate School of Engineering Sciences, Osaka University, Toyonaka 560, Japan;Faculty of Commerce and Business Administration, University of British Columbia, Vancouver, BC V6T 1Z2 Canada;Institute of Policy and Planning Sciences, University of Tsukuba, Tsukuba, Ibaraki 305, Japan
Venue:
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Year:
1998

Citing 12
Cited 1

A strongly polynomial minimum cost circulation algorithm

Combinatorica
A capacity-rounding algorithm for the minimum-cost circulation problem: A dual framework of the Tardos algorithm

Mathematical Programming: Series A and B
Layered augmenting path algorithms

Mathematics of Operations Research
An application of simultaneous Diophantine approximation in combinatorial optimization

Combinatorica
Generalized polymatroids and submodular flows

Mathematical Programming: Series A and B
A new approach to the maximum-flow problem

Journal of the ACM (JACM)
A strongly polynomial algorithm for minimum cost submodular flow problems

Mathematics of Operations Research
Finding minimum-cost circulations by canceling negative cycles

Journal of the ACM (JACM)
Finding minimum-cost circulations by successive approximation

Mathematics of Operations Research
Negative circuits for flows and submodular flows

Discrete Applied Mathematics
A capacity scaling algorithm for convex cost submodular flows

Mathematical Programming: Series A and B
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems

Journal of the ACM (JACM)

A Strongly Polynomial Cut Canceling Algorithm for the Submodular Flow Problem

Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract