Approximating minimum feedback sets and multicuts in directed graphs

Algorithmica (New York)

Volumn 20, Issue 2, 1998, Pages 151-174

  Even, G ^a   Naor, J ^b   Schieber, B ^c   Sudan, M ^c  

^a TEL AVIV UNIVERSITY   (Israel)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^c IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

Feedback edge set; Feedback vertex set; Multicuts

Indexed keywords

EID: 0000255727     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00009191     Document Type: Article

References (23)

1. M. Abramovici, M.A. Breuer, and A.D. Friedman, Digital Systems Testing and Testable Design, Computer Science Press, New York, 1990.
2. G. Even, J. Naor, S. Rao, and B. Schieber, Divide-and-conquer approximation algorithms via spreading metrics, Proc. of the 36th IEEE Conference on Foundations of Computer Science, pp. 62-71, 1995.
3. A. Frank and A. Gyarfas, Directed graphs and computer programs, Problemes Combinatoires et Theoriedes Graphes, Colloque Internationaux CNRS, 260, pp. 157-158, 1976.
4. R. Gupta, R. Gupta, and M.A. Breuer, BALLAST: a methodology for partial scan design, Proc. of the 19th International Symposium on Fault-Tolerant Computing, pp. 118-125, June, 1989.
5. N. Garg, V.V. Vazirani, and M. Yannakakis, Approximate max-flow min-(multi) cut theorems and their applications, SIAM Journal on Computing, 25(2):235-251, 1996.
6. M.X. Goemans and D.P. Williamson, Primal-dual approximation algorithms for feedback problems in planar graphs, Proc. of the 5th MPS Conference on Integer Programming and Combinatorial Optimization (IPCO), pp. 147-161, 1996.
7. T.C. Hu, Multi-commodity network flows, Operations Research, 11:344-360, 1963.
8. R.M. Karp, Reducibility among combinatorial problems, in Complexity of Computer Computations, pp. 85-104, Plenum, New York, 1972.
9. P.N. Klein, S.A. Plotkin, S. Rao, and É. Tardos, Approximation algorithms for Steiner and directed multicuts, Journal of Algorithms, 22:241-269, 1997.
10. P. Klein, R. Ravi, A. Agrawal, and S. Rao, An approximate max-flow min-cut relation for undirected multi-commodity flow, with applications, Combinatorica, 15(2):187-202, 1995.
11. P. Klein, C. Stein, and É. Tardos, Leighton-Rao might be practical: faster approximation algorithms for concurrent flow with uniform capacities, Proc. of the 22nd ACM Symposium on Theory of Computing, pp. 310-321, 1990.
12. A. Kunzmann and H.J. Wunderlich, An analytical approach to the partial scan problem, Journal of Electronic Testing: Theory and Applications, 1:163-174, 1990.
13. M. Luby and N. Nisan, A parallel approximation algorithm for positive linear programming, Proc. of the 25th ACM Symposium on Theory of Computing, pp. 448-457, 1993.
14. T. Leighton and S. Rao, An approximate max-flow min-cut theorem for uniform multi-commodity flow problems with applications to approximation algorithms, Proc. of the 29th IEEE Symposium on Foundations of Computer Science, pp. 422-431, 1988. Directed graphs are dealt with in manuscript, Feb. 1992.
15. C.E. Leiserson and J.B. Saxe, Retiming Synchronous Circuitry, Algorithmica, 6(1):5-35, 1991.
16. C.L. Lucchesi and H. Younger, A minimax theorem for directed graphs, Journal London Mathematical Society, 17:369-374, 1978.
17. Y Nesterov and A. Nemirovskii, Interior-Point Polynomial Algorithms in Convex Programming, SIAM, Philadelphia, PA, 1994.
18. S. Plotkin, D. Shmoys, and É. Tardos, Fast approximation algorithms for fractional packing and covering problems, Mathematics of Operations Research, 20:257-301, 1995.
19. V. Ramachandran, Finding a minimum feedback arc set in reducible flow graphs, Journal of Algorithms, 9:299-313, 1988.
20. V. Ramachandran, A minimax arc theorem for reducible flow graphs, SIAM Journal on Discrete Mathematics, 3:554-560, 1990.
21. P.D. Seymour, Packing directed circuits fractionally, Combinatorica, 15(2):281-288, 1995.
22. A.C. Shaw, The Logical Design of Operating Systems, Prentice-Hall, Englewood Cliffs, NJ, 1974.
23. M. Yannakakis, P.C. Kanellakis, S.S. Cosmadakis, and C.H. Papadimitriou, Cutting and partitioning a graph after a fixed pattern, Proc. of the 10th Colloquium on Automata, Languages and Programming, pp. 712-722, Lecture Notes in Computer Science, Vol. 154, Springer-Verlag, Berlin, 1983.