A simple combinatorial algorithm for submodular function minimization

Authors:
Satoru Iwata;James B. Orlin
Affiliations:
Kyoto University, Kyoto, Japan;MIT, Cambridge, MA
Venue:
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Year:
2009

Citing 8
Cited 15

On submodular function minimization

Combinatorica
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
Submodular function minimization

Mathematical Programming: Series A and B
A faster strongly polynomial time algorithm for submodular function minimization

Mathematical Programming: Series A and B
A strongly polynomial algorithm for line search in submodular polyhedra

Discrete Optimization

Approximating submodular functions everywhere

SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Note: The expressive power of binary submodular functions

Discrete Applied Mathematics
The complexity of valued constraint models

CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
An algorithmic framework for wireless information flow

Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Classes of submodular constraints expressible by graph cuts

Constraints
Partition constrained covering of a symmetric crossing supermodular function by a graph

SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
An approximation algorithm for computing a parsimonious first speciation in the gene duplication model

RECOMB-CG'10 Proceedings of the 2010 international conference on Comparative genomics
Submodular function minimization under a submodular set covering constraint

TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
Ranking with submodular valuations

Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
The matroid median problem

Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Submodular Approximation: Sampling-based Algorithms and Lower Bounds

SIAM Journal on Computing
Minimizing a sum of submodular functions

Discrete Applied Mathematics
Towards minimizing k-submodular functions

ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
Generic cuts: an efficient algorithm for optimal inference in higher order MRF-MAP

ECCV'12 Proceedings of the 12th European conference on Computer Vision - Volume Part V
Online submodular minimization

The Journal of Machine Learning Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a new simple algorithm for minimizing submodular functions. For integer valued submodular functions, the algorithm runs in O(n6EO log nM) time, where n is the cardinality of the ground set, M is the maximum absolute value of the function value, and EO is the time for function evaluation. The algorithm can be improved to run in O ((n4EO+n5)log nM) time. The strongly polynomial version of this faster algorithm runs in O((n5EO + n6) log n) time for real valued general submodular functions. These are comparable to the best known running time bounds for submodular function minimization. The algorithm can also be implemented in strongly polynomial time using only additions, subtractions, comparisons, and the oracle calls for function evaluation. This is the first fully combinatorial submodular function minimization algorithm that does not rely on the scaling method.