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]  Satoru Iwata,et al.  A combinatorial strongly polynomial algorithm for minimizing submodular functions , 2001, JACM.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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