Improved algorithms for submodular function minimization and submodular flow

Authors:
Lisa Fleischer;Satoru Iwata
Affiliations:
Dept. of Ind. Eng. & Oper. Res., Columbia University, New York, NY;Grad. School of Eng. Science, Osaka University, Toyonaka, Osaka 560-8531, Japan
Venue:
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Year:
2000

Citing 5
Cited 5

On submodular function minimization

Combinatorica
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
A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
A combinatorial algorithm minimizing submodular functions in strongly polynomial time

Journal of Combinatorial Theory Series B

A combinatorial strongly polynomial algorithm for minimizing submodular functions

Journal of the ACM (JACM)
A note on Schrijver's submodular function minimization algorithm

Journal of Combinatorial Theory Series B
The complexity of soft constraint satisfaction

Artificial Intelligence
A Faster Strongly Polynomial Time Algorithm for Submodular Function Minimization

IPCO '07 Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization
The complexity of soft constraint satisfaction

Artificial Intelligence

Quantified Score

Hi-index	0.03

Visualization

Abstract