BISUBMODULAR FUNCTION MINIMIZATION∗

This paper presents the first combinatorial polynomial algorithm for minimizing bisubmodular functions, extending the scaling algorithm for submodular function minimization due to Iwata, Fleischer, and Fujishige. Since the rank functions of delta-matroids are bisubmodular, the scaling algorithm naturally leads to the first combinatorial polynomial algorithm for testing membership in delta-matroid polyhedra.

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

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

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

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

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

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

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

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

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

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

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

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

[13]  Egon Balas,et al.  The perfectly Matchable Subgraph Polytope of an arbitrary graph , 1989, Comb..

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

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

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

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

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

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

[20]  László Lovász.  The Membership Problem in Jump Systems , 1997, J. Comb. Theory, Ser. B.

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

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

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