Primal-dual approximation algorithms for integral flow and multicut in trees

We study the maximum integral multicommodity flow problem and the minimum multicut problem restricted to trees. This restriction is quite rich and contains as special cases classical optimization problems such as matching and vertex cover for general graphs. It is shown that both the maximum integral multicommodity flow and the minimum multicut problem are NP-hard and MAX SNP-hard on trees, although the maximum integral flow can be computed in polynomial time if the edges have unit capacity. We present an efficient algorithm that computes a multicut and integral flow such that the weight of the multicut is at most twice the value of the flow. This gives a 2-approximation algorithm for minimum multicut and a 1/2-approximation algorithm for maximum integral multicommodity flow in trees.

[1]  R. Ravi,et al.  Approximation through multicommodity flow , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[2]  M. R. Rao,et al.  On the multiway cut polyhedron , 1991, Networks.

[3]  Carsten Lund,et al.  Efficient probabilistic checkable proofs and applications to approximation , 1994, STOC '94.

[4]  Alon Itai,et al.  On the Complexity of Timetable and Multicommodity Flow Problems , 1976, SIAM J. Comput..

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

[6]  Carsten Lund,et al.  On the hardness of approximating minimization problems , 1994, JACM.

[7]  S. Vajda,et al.  Integer Programming and Network Flows , 1970 .

[8]  W. T. Tutte.  An algorithm for determining whether a given binary matroid is graphic. , 1960 .

[9]  Mihalis Yannakakis,et al.  Cutting and Partitioning a Graph aifter a Fixed Pattern (Extended Abstract) , 1983, ICALP.

[10]  Mihalis Yannakakis,et al.  The Complexity of Multiterminal Cuts , 1994, SIAM J. Comput..

[11]  Carsten Lund,et al.  Efficient probabilistically checkable proofs and applications to approximations , 1993, STOC.

[12]  David P. Williamson,et al.  Primal-Dual Approximation Algorithms for Integral Flow and Multicut in Trees, with Applications to Matching and Set Cover , 1993, ICALP.

[13]  Carsten Lund,et al.  Proof verification and the hardness of approximation problems , 1998, JACM.

[14]  L. Lovász.  On some connectivity properties of Eulerian graphs , 1976 .

[15]  Anand Srivastav,et al.  Integer Multicommodity Flows with Reduced Demands , 1993, ESA.

[16]  Alexander Schrijver,et al.  Homotopic routing methods , 1990 .

[17]  SudanMadhu,et al.  Proof verification and the hardness of approximation problems , 1998 .

[18]  Carsten Lund,et al.  Proof verification and hardness of approximation problems , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[19]  Neil Robertson,et al.  Graph Minors .XIII. The Disjoint Paths Problem , 1995, J. Comb. Theory B.

[20]  Mihalis Yannakakis,et al.  Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications , 1996, SIAM J. Comput..

[21]  David P. Williamson,et al.  A primal-dual approximation algorithm for generalized steiner network problems , 1993, Comb..

[22]  David P. Williamson,et al.  A general approximation technique for constrained forest problems , 1992, SODA '92.

[23]  Ephraim Korach,et al.  Tight integral duality gap in the Chinese Postman problem , 1992, Math. Program..

[24]  Harold N. Gabow,et al.  An efficient reduction technique for degree-constrained subgraph and bidirected network flow problems , 1983, STOC.

[25]  Mihalis Yannakakis,et al.  Multiway Cuts in Directed and Node Weighted Graphs , 1994, ICALP.

[26]  Frank Thomson Leighton,et al.  An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[27]  Robert E. Bixby,et al.  An Almost Linear-Time Algorithm for Graph Realization , 1988, Math. Oper. Res..

[28]  Reuven Bar-Yehuda,et al.  A Linear-Time Approximation Algorithm for the Weighted Vertex Cover Problem , 1981, J. Algorithms.

[29]  Mihalis Yannakakis,et al.  The complexity of multiway cuts (extended abstract) , 1992, STOC '92.

[30]  Mihalis Yannakakis,et al.  Optimization, approximation, and complexity classes , 1991, STOC '88.

[31]  W. Mader.  Über die Maximalzahl kantendisjunkterA- Wege , 1978 .