A fully combinatorial algorithm for submodular function minimization

Authors:
Satoru Iwata
Affiliations:
University of Tokyo, Tokyo 113-8656, Japan
Venue:
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Year:
2002

Citing 8
Cited 0

On submodular function minimization

Combinatorica
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
Generalized polymatroids and submodular flows

Mathematical Programming: Series A and B
Computing edge-connectivity in multigraphs and capacitated graphs

SIAM Journal on Discrete Mathematics
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)

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper presents a strongly polynomial algorithm for submodular function minimization using only additions, subtractions, comparisons, and oracle calls for function values.