Submodular function minimization

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.

[1]  H. Whitney.  On the Abstract Properties of Linear Dependence , 1935 .

[2]  L. Shapley.  Cores of convex games , 1971 .

[3]  Richard M. Karp,et al.  Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems , 1972, Combinatorial Optimization.

[4]  Jack K. Wolf,et al.  Noiseless coding of correlated information sources , 1973, IEEE Trans. Inf. Theory.

[5]  Nimrod Megiddo,et al.  Optimal flows in networks with multiple sources and sinks , 1974, Math. Program..

[6]  Thomas M. Cover,et al.  A Proof of the Data Compression Theorem of Slepian and Wolf for Ergodic Sources , 1971 .

[7]  Satoru Fujishige,et al.  Polymatroidal Dependence Structure of a Set of Random Variables , 1978, Inf. Control..

[8]  Nimrod Megiddo.  Combinatorial Optimization with Rational Objective Functions , 1979, Math. Oper. Res..

[9]  Edward G. Coffman,et al.  A Characterization of Waiting Time Performance Realizable by Single-Server Queues , 1980, Oper. Res..

[10]  Satoru Fujishige,et al.  Lexicographically Optimal Base of a Polymatroid with Respect to a Weight Vector , 1980, Math. Oper. Res..

[11]  Martin Grötschel,et al.  The ellipsoid method and its consequences in combinatorial optimization , 1981, Comb..

[12]  Nimrod Megiddo,et al.  Applying parallel computation algorithms in the design of serial algorithms , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[13]  L. Lovász,et al.  Geometric Algorithms and Combinatorial Optimization , 1981 .

[14]  A. Frank.  An Algorithm for Submodular Functions on Graphs , 1982 .

[15]  László Lovász,et al.  Submodular functions and convexity , 1982, ISMP.

[16]  S. Fujishige.  Submodular systems and related topics , 1984 .

[17]  Satoru Fujishige.  Theory of submodular programs: A fenchel-type min-max theorem and subgradients of submodular functions , 1984, Math. Program..

[18]  William H. Cunningham,et al.  Testing membership in matroid polyhedra , 1984, J. Comb. Theory, Ser. B.

[19]  R. E. Bixby,et al.  The Partial Order of a Polymatroid Extreme Point , 1985, Math. Oper. Res..

[20]  William H. Cunningham.  On submodular function minimization , 1985, Comb..

[21]  C. Nash-Williams,et al.  Connected detachments of graphs and generalized Euler trails , 1985 .

[22]  Leonidas J. Guibas,et al.  Topologically sweeping an arrangement , 1986, STOC '86.

[23]  Timothy F. Havel,et al.  Some Combinatorial Properties of Discriminants in Metric Vector Spaces , 1986 .

[24]  Andrew V. Goldberg,et al.  A new approach to the maximum flow problem , 1986, STOC '86.

[25]  André Bouchet,et al.  Greedy algorithm and symmetric matroids , 1987, Math. Program..

[26]  Ramaswamy Chandrasekaran,et al.  Pseudomatroids , 1988, Discret. Math..

[27]  Awi Federgruen,et al.  Characterization and Optimization of Achievable Performance in General Queueing Systems , 1988, Oper. Res..

[28]  Robert E. Tarjan,et al.  A Fast Parametric Maximum Flow Algorithm and Applications , 1989, SIAM J. Comput..

[29]  C. St. J. A. Nash-Williams.  Another Proof of a Theorem Concerning Detachments of Graphs , 1991, Eur. J. Comb..

[30]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[31]  Satoru Fujishige,et al.  Submodular functions and optimization , 1991 .

[32]  S. Fujishige,et al.  New algorithms for the intersection problem of submodular systems , 1992 .

[33]  Toshihide Ibaraki,et al.  Computing Edge-Connectivity in Multigraphs and Capacitated Graphs , 1992, SIAM J. Discret. Math..

[34]  David D. Yao,et al.  Multiclass Queueing Systems: Polymatroidal Structure and Optimal Scheduling Control , 1992, Oper. Res..

[35]  András Frank,et al.  Submodular functions in graph theory , 1993, Discret. Math..

[36]  Maurice Queyranne,et al.  Structure of a simple scheduling polyhedron , 1993, Math. Program..

[37]  A. Frank.  Applications of submodular functions , 1993 .

[38]  Dimitris Bertsimas,et al.  Conservation laws, extended polymatroids and multi-armed bandit problems: a unified approach to ind exable systems , 2011, IPCO.

[39]  William H. Cunningham,et al.  Delta-Matroids, Jump Systems, and Bisubmodular Polyhedra , 1995, SIAM J. Discret. Math..

[40]  Éva Tardos,et al.  “The quickest transshipment problem” , 1995, SODA '95.

[41]  Dimitris Bertsimas,et al.  Conservation Laws, Extended Polymatroids and Multiarmed Bandit Problems; A Polyhedral Approach to Indexable Systems , 1996, Math. Oper. Res..

[42]  K. Murota.  Convexity and Steinitz's Exchange Property , 1996 .

[43]  Satoru Iwata,et al.  A capacity scaling algorithm for convex cost submodular flows , 1996, SODA '96.

[44]  Satoru Iwata,et al.  A Fast Parametric Submodular Intersection Algorithm for Strong Map Sequences , 1997, Math. Oper. Res..

[45]  Satoru Fujishige,et al.  A Min-Max Theorem for Bisubmodular Polyhedra , 1997, SIAM J. Discret. Math..

[46]  Toshihide Ibaraki,et al.  A Note on Minimizing Submodular Functions , 1998, Inf. Process. Lett..

[47]  Maurice Queyranne,et al.  Minimizing symmetric submodular functions , 1998, Math. Program..

[48]  Kazuo Murota,et al.  Discrete convex analysis , 1998, Math. Program..

[49]  Tibor Jordán,et al.  Detachments Preserving Local Edge-Connectivity of Graphs , 1999 .

[50]  Lisa Fleischer,et al.  Recent Progress in Submodular Function Minimization , 2000 .

[51]  Alexander Schrijver,et al.  A Combinatorial Algorithm Minimizing Submodular Functions in Strongly Polynomial Time , 2000, J. Comb. Theory B.

[52]  Romeo Rizzi.  NOTE – On Minimizing Symmetric Set Functions , 2000, Comb..

[53]  Satoru Iwata,et al.  Improved algorithms for submodular function minimization and submodular flow , 2000, STOC '00.

[54]  Satoru Iwata,et al.  A combinatorial strongly polynomial algorithm for minimizing submodular functions , 2001, JACM.

[55]  Jack Edmonds,et al.  Submodular Functions, Matroids, and Certain Polyhedra , 2001, Combinatorial Optimization.

[56]  Satoru Iwata,et al.  Bisubmodular Function Minimization , 2001, IPCO.

[57]  C. SIAMJ..  A FASTER SCALING ALGORITHM FOR MINIMIZING SUBMODULAR FUNCTIONS∗ , 2001 .

[58]  William H. Cunningham,et al.  Matching, matroids, and extensions , 2002, Math. Program..

[59]  J. A. d'Auriac,et al.  Optimal cooperation and submodularity for computing Potts' partition functions with a large number of states , 2002, cond-mat/0204055.

[60]  Satoru Iwata,et al.  A faster capacity scaling algorithm for minimum cost submodular flow , 2002, Math. Program..

[61]  Satoru Iwata,et al.  A fully combinatorial algorithm for submodular function minimization , 2001, SODA '02.

[62]  S. Fujishige.  Submodular function minimization and related topics , 2003, Optim. Methods Softw..

[63]  Jens Vygen,et al.  A note on Schrijver's submodular function minimization algorithm , 2003, J. Comb. Theory, Ser. B.

[64]  Satoru Iwata,et al.  A push-relabel framework for submodular function minimization and applications to parametric optimization , 2003, Discret. Appl. Math..

[65]  Alexander Schrijver,et al.  Combinatorial optimization. Polyhedra and efficiency. , 2003 .

[66]  Balázs Fleiner.  Detachment of Vertices of Graphs Preserving Edge-Connectivity , 2004, SIAM J. Discret. Math..

[67]  J. A. d'Auriac.  Computing the Potts Free Energy and Submodular Functions , 2005 .

[68]  Satoru Iwata,et al.  A Strongly Polynomial Cut Canceling Algorithm for Minimum Cost Submodular Flow , 2005, SIAM J. Discret. Math..

[69]  Satoru Iwata,et al.  Computational geometric approach to submodular function minimization for multiclass queueing systems , 2007, IPCO.

[70]  Kiyohito Nagano,et al.  A strongly polynomial algorithm for line search in submodular polyhedra , 2007, Discret. Optim..

[71]  Jens Vygen,et al.  The Book Review Column1 , 2020, SIGACT News.

[72]  S. Thomas McCormick,et al.  Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization , 2008, SODA '08.