Recent Progress in Submodular Function Minimization

This article is an attempt to relate the history and importance of the problem, the difficulties that arose in confronting it, the motivation for the solutions proposed, some consequences of the existence of these new algorithms, and some further challenges. *Graduate School of Industrial Administration, Carnegie Mellon University, 5000 Forbes Ave., Pittsburgh, PA 15213. This article was written while the author was a faculty member at the Department of Industrial Engineering and Operations Research, Columbia University, New York. Additional support provided by NSF through grant EIA-9973858.

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

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

[3]  J. G. Pierce,et al.  Geometric Algorithms and Combinatorial Optimization , 2016 .

[4]  Éva Tardos,et al.  A strongly polynomial minimum cost circulation algorithm , 1985, Comb..

[5]  Satoru Iwata,et al.  A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions , 2000, STOC '00.

[6]  James B. Orlin,et al.  A Faster Algorithm for Finding the Minimum Cut in a Directed Graph , 1994, J. Algorithms.

[7]  William H. Cunningham,et al.  Minimum cuts, modular functions, and matroid polyhedra , 1985, Networks.

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

[9]  S. Thomas McCormick,et al.  Two Strongly Polynomial Cut Cancelling Algorithms for Minimum Cost Network Flow , 1993, Discret. Appl. Math..

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

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

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

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

[14]  Satoru Iwata,et al.  A Strongly Polynomial Cut Canceling Algorithm for the Submodular Flow Problem , 1999, IPCO.

[15]  J. Edmonds,et al.  A Min-Max Relation for Submodular Functions on Graphs , 1977 .

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

[17]  András Frank,et al.  A Primal-Dual Algorithm for Submodular Flows , 1985, Math. Oper. Res..

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

[19]  András Frank,et al.  Finding feasible vectors of Edmonds-Giles polyhedra , 1984, J. Comb. Theory, Ser. B.

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

[21]  藤重 悟.  Submodular functions and optimization , 1991 .

[22]  P. Schönsleben.  Ganzzahlige Polymatroid-Intersektions-Algorithmen , 1980 .

[23]  E. L. Lawler,et al.  Computing Maximal "Polymatroidal" Network Flows , 1982, Math. Oper. Res..

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

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

[26]  Andrew V. Goldberg,et al.  Solving minimum-cost flow problems by successive approximation , 1987, STOC.

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

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

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

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

[31]  András Frank,et al.  Generalized polymatroids and submodular flows , 1988, Math. Program..

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

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

[34]  E. A. Dinic.  Algorithm for solution of a problem of maximal flow in a network with power estimation , 1970 .

[35]  S. Thomas McCormick,et al.  Fast algorithms for parametric scheduling come from extensions to parametric maximum flow , 1996, STOC '96.

[36]  Satoru Fujishige,et al.  A Strongly Polynomial Algorithm for Minimum Cost Submodular Flow Problems , 1989, Math. Oper. Res..

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