A Strongly Polynomial Cut Canceling Algorithm for Minimum Cost Submodular Flow

This paper presents a new strongly polynomial cut canceling algorithm for minimum cost submodular flow. The algorithm is a generalization of our similar cut canceling algorithm for ordinary min-cost flow. The algorithm scales a relaxed optimality parameter and creates a second, inner relaxation that is a kind of submodular max flow problem. The outer relaxation uses a novel technique for relaxing the submodular constraints that allows our previous proof techniques to work. The algorithm uses the min cuts from the max flow subproblem as the relaxed most positive cuts it chooses to cancel. We show that this algorithm needs to cancel only ${\mathrm O}(n^3)$ cuts per scaling phase, where $n$ is the number of nodes. Furthermore, we show how to slightly modify this algorithm to get a strongly polynomial running time. Finally, we briefly show how to extend this algorithm to the separable convex cost case and that the same technique can be used to construct a polynomial time maximum mean cut canceling algorithm for submodular flow.

[1]  Refael Hassin.  Algorithms for the minimum cost circulation problem based on maximizing the mean improvement , 1992, Oper. Res. Lett..

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

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

[4]  Uwe T. Zimmermann,et al.  A polynomial cycle canceling algorithm for submodular flows , 1999, Math. Program..

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

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

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

[8]  Andrew V. Goldberg,et al.  Finding minimum-cost circulations by canceling negative cycles , 1989, JACM.

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

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

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

[12]  S. Thomas McCormick,et al.  Polynomial Methods for Separable Convex Optimization in Unimodular Linear Spaces with Applications , 1997, SIAM J. Comput..

[13]  Tomasz Radzik.  Newton's method for fractional combinatorial optimization , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[14]  Satoru Iwata,et al.  Relaxed Most Negative Cycle and Most Positive Cut Canceling Algorithms for Minimum Cost Flow , 2000, Math. Oper. Res..

[15]  S. Fujishige.  ALGORITHMS FOR SOLVING THE INDEPENDENT-FLOW PROBLEMS , 1978 .

[16]  A. Schrijver.  Total Dual Integrality from Directed Graphs, Crossing Families, and Sub- and Supermodular Functions , 1984 .

[17]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[18]  S. Thomas McCormick,et al.  Minimum ratio canceling is oracle polynomial for linear programming, but not strongly polynomial, even for networks , 2000, SODA '00.

[19]  András Frank,et al.  A Weighted Matroid Intersection Algorithm , 1981, J. Algorithms.

[20]  Tomasz Radzik,et al.  Parametric Flows, Weighted Means of Cuts, and Fractional Combinatorial Optimization , 1993 .

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

[22]  Satoru Iwata,et al.  Fast Cycle Canceling Algorithms for Minimum Cost Submodular Flow* , 2003, Comb..

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

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

[25]  S. Fujishige,et al.  A PRIMAL ALGORITHM FOR THE SUBMODULAR FLOW PROBLEM WITH MINIMUM-MEAN CYCLE SELECTION , 1988 .

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

[27]  Uwe T. Zimmermann.  Negative circuits for flows and submodular flows , 1992, Discret. Appl. Math..

[28]  M. Iri,et al.  AN ALGORITHM FOR FINDING AN OPTIMAL "INDEPENDENT ASSIGNMENT" , 1976 .

[29]  Satoru Fujishige,et al.  Structures of polyhedra determined by submodular functions on crossing families , 1984, Math. Program..

[30]  S. Thomas McCormick,et al.  Canceling most helpful total submodular cuts for submodular flow , 1993, Conference on Integer Programming and Combinatorial Optimization.

[31]  Satoru Iwata,et al.  A fast cost scaling algorithm for submodular flow , 2000, Inf. Process. Lett..

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

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

[34]  S. Thomas McCormick,et al.  Computing Maximum Mean Cuts , 1994, Discret. Appl. Math..

[35]  Satoru Fujishige,et al.  A capacity-rounding algorithm for the minimum-cost circulation problem: A dual framework of the Tardos algorithm , 1986, Math. Program..

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

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

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

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

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

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

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

[43]  S. Thomas McCormick,et al.  Canceling most helpful total cuts for minimum cost network flow , 1993, Networks.