Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization

Bisubmodular functions are a natural “directed”, or “signed”, extension of submodular functions with several applications. Recently Fujishige and Iwata showed how to extend the Iwata, Fleischer, and Fujishige (IFF) algorithm for submodular function minimization (SFM) to bisubmodular function minimization (BSFM). However, they were able to extend only the weakly polynomial version of IFF to BSFM. Here we investigate the difficulty that prevented them from also extending the strongly polynomial version of IFF to BSFM, and we show a way around the difficulty. This new method gives a somewhat simpler strongly polynomial SFM algorithm, as well as the first combinatorial strongly polynomial algorithm for BSFM. This further leads to extending Iwata’s fully combinatorial version of IFF to BSFM.

[1]  Satoru Iwata,et al.  Bisubmodular Function Minimization , 2005, SIAM J. Discret. Math..

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

[3]  Maurice Queyranne,et al.  Single-Machine Scheduling Polyhedra with Precedence Constraints , 1991, Math. Oper. Res..

[4]  Jesús Mario Bilbao,et al.  A Survey of Bicooperative Games , 2008 .

[5]  Satoru Fujishige.  A system of linear inequalities with a submodular function on {0,±1}; vectors☆ , 1984 .

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

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

[8]  Satoru Fujishige,et al.  Decomposition of a Bidirected Graph into Strongly Connected Components and Its Signed Poset Structure , 1996, Discret. Appl. Math..

[9]  S. Fujishige,et al.  The Minimum-Norm-Point Algorithm Applied to Submodular Function Minimization and Linear Programming , 2006 .

[10]  S. Thomas McCormick,et al.  Submodular Function Minimization , 2005 .

[11]  Kiyohito Nagano,et al.  On Convex Minimization over Base Polytopes , 2007, IPCO.

[12]  Liqun Qi,et al.  Directed submodularity, ditroids and directed submodular flows , 1988, Math. Program..

[13]  Satoru Fujishige,et al.  THE MINIMUM-WEIGHT IDEAL PROBLEM FOR SIGNED POSETS , 1996 .

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

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

[16]  Ramaswamy Chandrasekaran,et al.  On totally dual integral systems , 1990, Discret. Appl. Math..

[17]  Satoru Iwata,et al.  Submodular function minimization , 2007, Math. Program..

[18]  James B. Orlin,et al.  A Faster Strongly Polynomial Time Algorithm for Submodular Function Minimization , 2007, IPCO.

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

[20]  Satoru Fujishige,et al.  A characterization of bisubmodular functions , 1996, Discret. Math..

[21]  A. Schrijver,et al.  Proving total dual integrality with cross-free families—A general framework , 1984, Math. Program..

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

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

[24]  D. SIAMJ..  BISUBMODULAR FUNCTION MINIMIZATION∗ , 2006 .

[25]  William J. Cook,et al.  The Traveling Salesman Problem: A Computational Study , 2007 .

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

[27]  Nimrod Megiddo,et al.  Combinatorial optimization with rational objective functions , 1978, Math. Oper. Res..

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

[29]  André Bouchet,et al.  Matchings and -matroids , 1989, Discret. Appl. Math..

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

[31]  Victor Reiner,et al.  Signed Posets , 1993, J. Comb. Theory, Ser. A.

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

[33]  Alexander Schrijver,et al.  Theory of linear and integer programming , 1986, Wiley-Interscience series in discrete mathematics and optimization.

[34]  D. J. A. Welsh,et al.  A greedy algorithm for solving a certain class of linear programmes , 1973, Math. Program..

[35]  Andrew V. Goldberg,et al.  Finding Minimum-Cost Circulations by Successive Approximation , 1990, Math. Oper. Res..

[36]  Satoru Iwata.  A Faster Scaling Algorithm for Minimizing Submodular Functions , 2003, SIAM J. Comput..

[37]  William H. Cunningham,et al.  A separation algorithm for the matchable set polytope , 1994, Math. Program..

[38]  Satoru Fujishige,et al.  On structures of bisubmodular polyhedra , 1996, Math. Program..

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

[40]  藤重 悟,et al.  closed Families and Signed Posets , 1994 .

[41]  Andrew V. Goldberg,et al.  Maximum skew-symmetric flows and matchings , 2004, Math. Program..

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

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

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

[45]  Dorit S. Hochbaum.  Polynomial and Strongly Polynomial Algorithms for Convex Network Optimization , 1993 .

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

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

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

[49]  Fan Zhang.  A Separation Algorithm for B-Matching Degree-Sequence Polyhedra , 2003, Math. Oper. Res..

[50]  William H. Cunningham,et al.  b-matching degree-sequence polyhedra , 1991, Comb..

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