Minimal multicut and maximal integer multiflow: A survey

We present a survey about the maximum integral multiflow and minimum multicut problems and their subproblems, such as the multiterminal cut and the unsplittable flow problems. We consider neither continuous multiflow nor minimum cost multiflow. Most of the results are very recent and some are new. We recall the dual relationship between both problems, give complexity results and algorithms, firstly in unrestricted graphs and secondly in several special graphs: trees, bipartite or planar graphs. A table summarizes the most important results.

[1]  Mihalis Yannakakis,et al.  Approximate max-flow min-(multi)cut theorems and their applications , 1993, SIAM J. Comput..

[2]  Yuval Rabani,et al.  Approximating Directed Multicuts , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[3]  Éva Tardos,et al.  Improved Bounds for the Max-Flow Min-Multicut Ratio for Planar and K_r, r-Free Graphs , 1993, Inf. Process. Lett..

[4]  Rajeev Motwani,et al.  Coloring Away Communication in Parallel Query Optimization , 1995, VLDB.

[5]  Dimitris Bertsimas,et al.  Analysis of LP relaxations for multiway and multicut problems , 1999 .

[6]  R. Kraut,et al.  Vehicle scheduling in public transit and Lagrangean pricing , 1998 .

[7]  MATTHIAS MIDDENDORF,et al.  On the complexity of the disjoint paths problem , 1993, Comb..

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

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

[10]  Siam Staff.  A 2-Approximation Algorithm for the Directed Multiway Cut Problem , 2002 .

[11]  Matteo Fischetti,et al.  A polyhedral approach to an integer multicommodity flow problem , 2000, Discret. Appl. Math..

[12]  Dorit S. Hochbaum,et al.  A Polynomial Algorithm for the k-cut Problem for Fixed k , 1994, Math. Oper. Res..

[13]  Michel Minoux,et al.  Graphs and Algorithms , 1984 .

[14]  Dorit S. Hochbaum,et al.  Approximation Algorithms for NP-Hard Problems , 1996 .

[15]  Matthew S. Levine.  Fast randomized algorithms for computing minimum {3,4,5,6}-way cuts , 2000, SODA '00.

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

[17]  László A. Székely,et al.  On weighted multiway cuts in trees , 1994, Math. Program..

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

[19]  T. C. Hu.  Two-commodity cut-packing problem , 1973, Math. Program..

[20]  James B. Orlin.  A Faster Strongly Polynomial Minimum Cost Flow Algorithm , 1993, Oper. Res..

[21]  Maria Zrikem,et al.  Variable neighborhood decomposition search for the optimization of power plant cable layout , 2002, J. Intell. Manuf..

[22]  András Frank,et al.  On Integer Multiflow Maximization , 1997, SIAM J. Discret. Math..

[23]  Lucas Létocart.  Problèmes de multicoupe et de multiflot en nombres entiers , 2002 .

[24]  Frank Thomson Leighton,et al.  Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms , 1999, JACM.

[25]  Alexander Schrijver,et al.  Paths, Flows, and VLSI-Layout , 1990 .

[26]  C. Stein,et al.  Better Rounding Algorithms for a Geometric Embedding Relaxation of Minimum Multiway Cut , 1999, Symposium on the Theory of Computing.

[27]  András Sebő.  Integer plane multiflows with a fixed number of demands , 1993 .

[28]  A. Mackay.  On complexity , 2001 .

[29]  John E. Hopcroft,et al.  The Directed Subgraph Homeomorphism Problem , 1978, Theor. Comput. Sci..

[30]  Frédéric Roupin,et al.  A greedy algorithm for multicut and integral multiflow in rooted trees , 2003, Oper. Res. Lett..

[31]  Mihalis Yannakakis,et al.  Primal-dual approximation algorithms for integral flow and multicut in trees , 1997, Algorithmica.

[32]  Éva Tardos,et al.  Disjoint paths in densely embedded graphs , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[33]  Klaus Jansen,et al.  The Maximum Edge-Disjoint Paths Problem in Bidirected Trees , 2001, SIAM J. Discret. Math..

[34]  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.

[35]  Marie-Christine Costa,et al.  Variable Neighborhood Search for the Optimization of Cable Layout Problem , 2001 .

[36]  B. Rothschild,et al.  On Two Commodity Network Flows , 1966, Oper. Res..

[37]  David B. Shmoys,et al.  Cut problems and their application to divide-and-conquer , 1996 .

[38]  William H. Cunningham.  The Optimal Multiterminal Cut Problem , 1989, Reliability Of Computer And Communication Networks.

[39]  Alain Hertz,et al.  Bounds and Heuristics for the Shortest Capacitated Paths Problem , 2002, J. Heuristics.

[40]  James B. Orlin,et al.  A faster strongly polynomial minimum cost flow algorithm , 1993, STOC '88.

[41]  Paul D. Seymour,et al.  A two-commodity cut theorem , 1978, Discret. Math..

[42]  Jon M. Kleinberg,et al.  Approximation algorithms for disjoint paths problems , 1996 .

[43]  Frédéric Roupin,et al.  From Linear to Semidefinite Programming: An Algorithm to Obtain Semidefinite Relaxations for Bivalent Quadratic Problems , 2004, J. Comb. Optim..

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

[45]  Anand Srivastav,et al.  On Complexity, Representation and Approximation of Integral Multicommodity Flows , 2000, Discret. Appl. Math..

[46]  Yuval Rabani,et al.  An improved approximation algorithm for multiway cut , 1998, STOC '98.

[47]  Michel Minoux,et al.  Graphes et algorithmes , 1995 .

[48]  T. C. Hu.  Multi-Commodity Network Flows , 1963 .

[49]  S. Rajagopalan.  Two commodity flows , 1994, Oper. Res. Lett..

[50]  Cynthia Barnhart,et al.  Using Branch-and-Price-and-Cut to Solve Origin-Destination Integer Multicommodity Flow Problems , 2000, Oper. Res..

[51]  Aravind Srinivasan,et al.  Approximation Algorithms for Disjoint Paths and Related Routing and Packing Problems , 2000, Math. Oper. Res..

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

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

[54]  Ephraim Korach,et al.  A Fast Algorithm for Maximum Integral Two-Commodity Flow in Planar Graphs , 1993, Discret. Appl. Math..

[55]  Richard M. Karp,et al.  On the Computational Complexity of Combinatorial Problems , 1975, Networks.

[56]  Peter Kubat,et al.  Multicommodity Flows in Ring Networks , 1996, INFORMS J. Comput..

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

[58]  Marek Chrobak,et al.  Reconstructing Polyatomic Structures from Discrete X-Rays: NP-Completeness Proof for Three Atoms , 1998, MFCS.

[59]  Iraj Saniee,et al.  An optimization problem related to balancing loads on SONET rings , 1994, Telecommun. Syst..

[60]  Christian Scheideler,et al.  Improved bounds for the unsplittable flow problem , 2002, SODA '02.

[61]  Éva Tardos,et al.  Approximations for the disjoint paths problem in high-diameter planar networks , 1995, STOC '95.

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

[63]  Venkatesan Guruswami,et al.  Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems , 2003, J. Comput. Syst. Sci..

[64]  Y. L. Chen,et al.  Multicommodity Network Flows with Safety Considerations , 1992, Oper. Res..

[65]  R. Steele.  Optimization , 2005 .

[66]  James F. Lynch,et al.  The equivalence of theorem proving and the interconnection problem , 1975, SIGD.