A fully combinatorial algorithm for submodular function minimization

Authors:
Satoru Iwata
Affiliations:
Department of Mathematical Informatics, Graduate School of Information Science and Technology, University of Tokyo, Tokyo, Japan
Venue:
Journal of Combinatorial Theory Series B
Year:
2002

Citing 8
Cited 13

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)

A combinatorial strongly polynomial algorithm for minimizing submodular functions

Journal of the ACM (JACM)
A Faster Scaling Algorithm for Minimizing Submodular Functions

Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
A Coordinatewise Domain Scaling Algorithm for M-convex Function Minimization

Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
Traveling salesman games with the Monge property

Discrete Applied Mathematics
Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization

Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Generalising submodularity and horn clauses: Tractable optimization problems defined by tournament pair multimorphisms

Theoretical Computer Science
Minimization of Locally Defined Submodular Functions by Optimal Soft Arc Consistency

Constraints
A simple combinatorial algorithm for submodular function minimization

SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Earliest Arrival Flows with Multiple Sources

Mathematics of Operations Research
Note: The expressive power of binary submodular functions

Discrete Applied Mathematics
Minimizing count-based high order terms in markov random fields

EMMCVPR'11 Proceedings of the 8th international conference on Energy minimization methods in computer vision and pattern recognition
An algebraic characterisation of complexity for valued constraint

CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
A strongly polynomial algorithm for line search in submodular polyhedra

Discrete Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

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