Approximating minimum feedback sets andmulti-cuts in directed graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 920, Issue , 1995, Pages 14-28

  Even, Guy ^a   Naor, Joseph Seffi ^a   Schieber, Baruch ^b   Sudan, Madhu ^b  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

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

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; COMBINATORIAL OPTIMIZATION; COMPUTATIONAL COMPLEXITY; INTEGER PROGRAMMING; LINEAR PROGRAMMING; SET THEORY;

APPROXIMATE SOLUTION; APPROXIMATION FACTOR; DIRECTED NETWORK; FEEDBACK SETS; FRACTIONAL SOLUTIONS; MINIMUM TOTAL WEIGHTS; OPTIMAL FEEDBACK; WEIGHTED FEEDBACK VERTEX SETS;

DIRECTED GRAPHS;

EID: 84948977289     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-59408-6_38     Document Type: Conference Paper

References (14)

1. M. Abramovici, M.A. Breuer and A.D. Friedman, "Digital Systems Testing and Testable Design," New York, Computer Science Press, 1990.
2. N. Garg, V.V. Vazirani and M. Yannakakis, "Approximate max-flow min-(multi) cut theorems and their applications," 25th STOC, pp. 698-707, 1993.
3. R. Gupta, R. Gupta and M.A. Breuer, "BALLAST: A Methodology for Partial Scan Design," Proc. 19th Int'l. Syrup. on Fault-Tolerant Computing, 'pp. 118-125, June, 1989.
4. T.C. Hu, "Multi-commodity network flows," Operatwns Research, 11, pp. 344-360, 1963.
5. R.M. Karp, "Reducibility among combinatorial problems," Complexty of Computer Computations, pp. 85-104, Plenum Press, N.Y., 1972.
6. P.N. Klein, S.A. Plotkin, S. Rap and É. Tardos, "New network decompositions theorems with applications," unpublished manuscript, 1993.
7. P. Klein, A. Agrawal, R. Ravi, and S. Rao, "Approximation through multicommodity flow," 31se FOCS, pp. 726-737, 1990.
8. P. Klein, C. Stein, and É. Tardos, "Leighton-Rao might be practical: faster approximation algorithms for concurrent flow with uniform capacities," 22nd STOC, pp. 310-321, 1990.
9. A. Kunzmann and H.J. Wunderlich, "An Analytical Approach to the Partial Scan Problem," Journal of Elec. Testing: Theory and Applications, 1, pp. 163-174, 1990.
10. M. Luby and N. Nisan, "A parallel approximation algorithm for positive linear programming," 25th STOC, pp. 448-457, 1993.
11. T. Leighton and S. Rao, "An approximate max-flow min-cut theorem for uniform multi-commodity flow problems with applications to approximation algorithms," 29th FOCS, pp. 422-431, 1988. Directed graphs are dealt with in manuscript, Feb., 1992.
12. C.E. Leiserson and J.B. Saxe, "Retiming Synchronous Circuitry," Algorithmica, Vol. 6, No. 1, pp. 5-35. 1991.
13. S. Plotldn, É. Tardos and D. Shmoys, "Fast approximation algorithms for fractional packing and covering problems", 32nd FOCS, pp. 495-504, 1991.
14. P.D. Seymour, "Packing Directed Circuits Fractionally," Manuscript, (1992). To appear in Combinatorica.