A combinatorial strongly polynomial algorithm for minimizing submodular functions

This paper presents a combinatorial polynomial-time algorithm for minimizing submodular functions, answering an open question posed in 1981 by Grötschel, Lovász, and Schrijver. The algorithm employs a scaling scheme that uses a flow in the complete directed graph on the underlying set with each arc capacity equal to the scaled parameter. The resulting algorithm runs in time bounded by a polynomial in the size of the underlying set and the length of the largest absolute function value. The paper also presents a strongly polynomial version in which the number of steps is bounded by a polynomial in the size of the underlying set, independent of the function values.

[1]  J. Edmonds.  Systems of distinct representatives and linear algebra , 1967 .

[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]  J. Edmonds,et al.  A Min-Max Relation for Submodular Functions on Graphs , 1977 .

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

[6]  Te Sun Han,et al.  The Capacity Region of General Multiple-Access Channel with Certain Correlated Sources , 1979, Inf. Control..

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

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

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

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

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

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

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

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

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

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

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

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

[19]  András Frank,et al.  An application of simultaneous diophantine approximation in combinatorial optimization , 1987, Comb..

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

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

[22]  A. Frank,et al.  An application of submodular flows , 1989 .

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

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

[25]  Arie Tamir,et al.  A Unifying Location Model on Tree Graphs Based on Submodularity Properties , 1993, Discret. Appl. Math..

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

[27]  K. Murota,et al.  Block-Triangularizations of Partitioned Matrices under Similarity/Equivalence Transformations , 1994 .

[28]  H. Narayanan.  A rounding technique for the polymatroid membership problem , 1995 .

[29]  Satoru Iwata,et al.  A Minimax Theorem and a Dulmage-Mendelsohn Type Decomposition for a Class of Generic Partitioned Matrices , 1995, SIAM J. Matrix Anal. Appl..

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

[31]  Michel X. Goemans,et al.  Minimizing submodular functions over families of sets , 1995, Comb..

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

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

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

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

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

[37]  Satoru Iwata,et al.  Algorithms for submodular flows , 2000 .

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

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

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