A Faster Scaling Algorithm for Minimizing Submodular Functions

Authors:
Satoru Iwata
Affiliations:
-
Venue:
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
Year:
2002

Citing 7
Cited 2

On submodular function minimization

Combinatorica
A capacity scaling algorithm for convex cost submodular flows

Mathematical Programming: Series A and B
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 fully combinatorial algorithm for submodular function minimization

Journal of Combinatorial Theory Series B
A push-relabel framework for submodular function minimization and applications to parametric optimization

Discrete Applied Mathematics - Submodularity
A capacity scaling algorithm for M-convex submodular flow

Mathematical Programming: Series A and B

A note on Schrijver's submodular function minimization algorithm

Journal of Combinatorial Theory Series B
On the complexity of submodular function minimisation on diamonds

Discrete Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

Combinatorial strongly polynomial algorithms for minimizing submodular functions have been developed by Iwata, Fleischer, and Fujishige (IFF) and by Schrijver. The IFF algorithm employs a scaling scheme for submodular functions, whereas Schrijver's algorithm exploits distance labeling. This paper combines these two techniques to yield a faster combinatorial algorithm for submodular function minimization. The resulting algorithm improves over the previously best known bound by an almost linear factor in the size of the underlying ground set.