Approximating Minimum Feedback Sets and Multicuts in Directed Graphs

Abstract. This paper deals with approximating feedback sets in directed graphs. We consider two related problems: the weighted feedback vertex set (FVS) problem, and the weighted feedback edge set (FES) problem. In the {FVS} (resp. FES) problem, one is given a directed graph with weights (each of which is at least one) on the vertices (resp. edges), and is asked to find a subset of vertices (resp. edges) with minimum total weight that intersects every directed cycle in the graph. These problems are among the classical NP-hard problems and have many applications. We also consider a generalization of these problems: subset-fvs and subset-fes, in which the feedback set has to intersect only a subset of the directed cycles in the graph. This subset consists of all the cycles that go through a distinguished input subset of vertices and edges, denoted by X . This generalization is also NP-hard even when |X|=2 . We present approximation algorithms for the subset-fvs and subset-fes problems. The first algorithm we present achieves an approximation factor of O(log2|X|) . The second algorithm achieves an approximation factor of O(min{log τ* log log τ*, log n log log n)} , where τ* is the value of the optimum fractional solution of the problem at hand, and n is the number of vertices in the graph. We also define a multicut problem in a special type of directed networks which we call circular networks, and show that the subset-fes and subset-fvs problems are equivalent to this multicut problem. Another contribution of our paper is a combinatorial algorithm that computes a (1+ɛ) approximation to the fractional optimal feedback vertex set. Computing the approximate solution is much simpler and more efficient than general linear programming methods. All of our algorithms use this approximate solution.

[1]  David P. Williamson,et al.  Primal-Dual Approximation Algorithms for Feedback Problems , 1996, IPCO.

[2]  Arno Kunzmann,et al.  An analytical approach to the partial scan problem , 1990, J. Electron. Test..

[3]  Joseph Naor,et al.  Divide-and-conquer approximation algorithms via spreading metrics , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[4]  Yurii Nesterov,et al.  Interior-point polynomial algorithms in convex programming , 1994, Siam studies in applied mathematics.

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

[6]  Richard M. Karp,et al.  Reducibility among combinatorial problems" in complexity of computer computations , 1972 .

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

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

[9]  Éva Tardos,et al.  Fast approximation algorithms for fractional packing and covering problems , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[10]  Philip N. Klein,et al.  Leighton-Rao might be practical: faster approximation algorithms for concurrent flow with uniform capacities , 1990, STOC '90.

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

[12]  Vijaya Ramachandran,et al.  Finding a Minimum Feedback Arc Set in Reducible Flow Graphs , 1988, J. Algorithms.

[13]  Melvin A. Breuer,et al.  Digital systems testing and testable design , 1990 .

[14]  Philip N. Klein,et al.  Approximation Algorithms for Steiner and Directed Multicuts , 1997, J. Algorithms.

[15]  Noam Nisan,et al.  A parallel approximation algorithm for positive linear programming , 1993, STOC.

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

[17]  Alan Shaw,et al.  The logical design of operating systems , 1987 .

[18]  M. Yannakakis,et al.  Approximate Max--ow Min-(multi)cut Theorems and Their Applications , 1993 .

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

[20]  Vijaya Ramachandran,et al.  A Minimax Arc Theorem for Reducible Flow Graphs , 1990, SIAM J. Discret. Math..

[21]  Melvin A. Breuer,et al.  BALLAST: a methodology for partial scan design , 1989, [1989] The Nineteenth International Symposium on Fault-Tolerant Computing. Digest of Papers.

[22]  C. Lucchesi,et al.  A Minimax Theorem for Directed Graphs , 1978 .