Approximation Algorithms for Steiner and Directed Multicuts

In this paper we consider theSteiner multicutproblem. This is a generalization of the minimum multicut problem where instead of separating nodepairs, the goal is to find a minimum weight set of edges that separates all givensetsof nodes. A set is considered separated if it is not contained in a single connected component. We show anO(log3(kt)) approximation algorithm for the Steiner multicut problem, wherekis the number of sets andtis the maximum cardinality of a set. This improves theO(tlogk) bound that easily follows from the previously known multicut results. We also consider an extension of multicuts to directed case, namely the problem of finding a minimum-weight set of edges whose removal ensures that none of the strongly connected components includes one of the prespecifiedknode pairs. In this paper we describe anO(log2k) approximation algorithm for this directed multicut problem. Ifk?n, this represents an improvement over theO(lognloglogn) approximation algorithm that is implied by the technique of Seymour.

[1]  Mihalis Yannakakis,et al.  On the approximation of maximum satisfiability , 1992, SODA '92.

[2]  Éva Tardos,et al.  Fast Approximation Algorithms for Fractional Packing and Covering Problems , 1995, Math. Oper. Res..

[3]  David S. Johnson,et al.  Approximation algorithms for combinatorial problems , 1973, STOC.

[4]  Paul D. Seymour,et al.  Packing directed circuits fractionally , 1995, Comb..

[5]  Éva Tardos,et al.  Improved bounds on the max-flow min-cut ratio for multicommodity flows , 1993, Comb..

[6]  Pravin M. Vaidya,et al.  A new algorithm for minimizing convex functions over convex sets , 1989, 30th Annual Symposium on Foundations of Computer Science.

[7]  Tomasz Radzik.  Fast deterministic approximation for the multicommodity flow problem , 1995, SODA '95.

[8]  David P. Williamson,et al.  Approximation algorithms , 1997 .

[9]  David B. Shmoys,et al.  Computing near-optimal solutions to combinatorial optimization problems , 1994, Combinatorial Optimization.

[10]  Joseph Naor,et al.  Approximating Minimum Feedback Sets and Multi-Cuts in Directed Graphs , 1995, IPCO.

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

[12]  Andrew V. Goldberg,et al.  Network decomposition and locality in distributed computation , 1989, 30th Annual Symposium on Foundations of Computer Science.

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

[14]  Bruce A. Reed,et al.  Packing directed circuits , 1996, Comb..

[15]  Joseph Naor,et al.  Approximating Minimum Feedback Sets and Multicuts in Directed Graphs , 1998, Algorithmica.

[16]  Pravin M. Vaidya,et al.  A new algorithm for minimizing convex functions over convex sets , 1996, Math. Program..

[17]  Eli Upfal,et al.  A trade-off between space and efficiency for routing tables , 1989, JACM.

[18]  Baruch Awerbuch,et al.  Improved Routing Strategies with Succinct Tables , 1990, J. Algorithms.

[19]  David P. Williamson,et al.  A new \frac34-approximation algorithm for MAX SAT , 1993, Conference on Integer Programming and Combinatorial Optimization.

[20]  Satish Rao,et al.  An approximate max-flow min-cut relation for undirected multicommodity flow, with applications , 1995, Comb..

[21]  Baruch Awerbuch,et al.  Network synchronization with polylogarithmic overhead , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

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