Submodular function minimization

Authors:
Satoru Iwata
Affiliations:
Kyoto University, Research Institute for Mathematical Sciences, 606-8502, Kyoto, Japan
Venue:
Mathematical Programming: Series A and B
Year:
2007

Citing 0
Cited 19

Matroid intersection, pointer chasing, and Young's seminormal representation of Sn

Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Classes of Submodular Constraints Expressible by Graph Cuts

CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
The expressive power of valued constraints: Hierarchies and collapses

Theoretical Computer Science
Appointment scheduling with discrete random durations

SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
A simple combinatorial algorithm for submodular function minimization

SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
A Structure Theory for the Parametric Submodular Intersection Problem

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

Discrete Applied Mathematics
Divide-and-Conquer Algorithms for Partitioning Hypergraphs and Submodular Systems

ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Classes of submodular constraints expressible by graph cuts

Constraints
Appointment Scheduling with Discrete Random Durations

Mathematics of Operations Research
Ranking with submodular valuations

Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Polymatroids and mean-risk minimization in discrete optimization

Operations Research Letters
On the complexity of submodular function minimisation on diamonds

Discrete Optimization
Submodular Approximation: Sampling-based Algorithms and Lower Bounds

SIAM Journal on Computing
Submodular minimization via pathwidth

TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
Towards minimizing k-submodular functions

ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
Online prediction under submodular constraints

ALT'12 Proceedings of the 23rd international conference on Algorithmic Learning Theory
Separation and Extension of Cover Inequalities for Conic Quadratic Knapsack Constraints with Generalized Upper Bounds

INFORMS Journal on Computing
Tractable Hypergraph Properties for Constraint Satisfaction and Conjunctive Queries

Journal of the ACM (JACM)

Quantified Score

Hi-index	0.01

Visualization

Abstract

Submodular functions often arise in various fields of operations research including discrete optimization, game theory, queueing theory and information theory. In this survey paper, we give overview on the fundamental properties of submodular functions and recent algorithmic devolopments of their minimization.