Primal-dual approximation algorithms for integral flow and multicut in trees, with applications to matching and set cover

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

Volumn 700 LNCS, Issue , 1993, Pages 64-75

  Garg, Naveen ^a   Vazirani, Vijay V ^a   Yannakakis, Mihalis ^b  

^a INDIAN INSTITUTE OF TECHNOLOGY DELHI   (India)

^b LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84866516599     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-56939-1_62     Document Type: Conference Paper

References (24)

1. rd IEEE Symp. On Foundations of Computer Science, 14-23 (1992).
2. R. Bar-Yehuda, S. Even: A linear time approximation algorithm for the weighted vertex cover problem. J. Algorithms 2, 198-203 (1981).
3. R.E. Bixby, D.K. Wagner: An almost linear time algorithm for graph realization. Mathematics of Operations Research 13, 99-123 (1988)
4. S. Chopra, M.R. Rao: On the multiway cut polyhedron. Networks 21, 51-89 (1991).
5. E. Dalhaus, D.S. Johnson, C.H. Papadimitriou, P.D. Seymour, M. Yannakakis: The complexity of multiway cuts. Proc. 24 th ACM Symposium on Theory of Computing (1992).
6. J. Edmonds: Maximum matching and a polyhedron with (0,1) vertices. J. Res. Nat. Bur. Standards Sect. B 69B, 125-130 (1965).
7. A. Frank: Packing paths, circuits and cuts -a survey. In: B. Korte, L. Lovasz, H.J. Promel A. Schrijver (eds.): Paths, Flows and VLSI-Layout. Algorithms and Combinatorics 9. Springer, pp. 47-100.
8. M. Grotschel, L. Lovasz, A. Schrijver: The ellipsoid method and its consequences in combinatorial optimization. Combinatorica 1, 169-197 (1981).
9. N. Garg, V.V. Vazirani, M. Yannakakis: Approximate max-flow min-(multi)cut theorems and their applications. 25 th ACM Symposium on Theory of Computing (1993).
10. M.X. Goemans, D.P. Williamson: A general approximation technique for constrained forest problems. 3 rd Annual ACM-SIAM Symposium on Discrete Algorithms (1992).
11. V. Kann. On the approximability of NP-complete optimization problems. Ph.D. Thesis, Royal Institute of Technology, Stockholm, 1992.
12. P. Klein, A. Agrawal, R. Ravi, S. Rao: Approximation through multicommodity flow. 31 st Symposium on Foundations of Computer Science, 726-737 (1990).
13. P. Klein, S. Plotkin, S. Rao: Excluded minors, network decomposition, and multicommodity flow. 25 th ACM Symposium on Theory of Computing (1993).
14. L. Lovasz: Graph theory and integer programming, Discrete Optimization I. In: P.L. Hammer, E.L. Johnson, B. Korte (eds.): Ann. Discrete Math. 4. Amsterdam: North-Holland 1979, pp. 141-158.
15. F.T. Leighton, S. Rao: An approximate max-flow rain-cut theorem for uniform multicommodity flow problems with application to approximation algorithms. 29 th Symposium on Foundations of Computer Science, 422-431 (1988).
16. C. Lund, M. Yannakakis: On the hardness of approximating minimization problems. 25 th ACM Symposium on Theory of Computing (1993).
17. W.R. Pulleyblank: Faces of matching polyhedra. Ph.D. Thesis: Univ. of Waterloo: Dept. Combinatorics and Optimization, 1973.
18. C.H. Papadimitriou, K. Steiglitz: Combinatorial Optimization: Algorithms and Complexity. New Jersey: Prentice Hall Inc., 1982.
19. C. H. Papadimitriou, and M. Yannakakis. Optimization, approximation and complexity classes. J. of Computer and System Sciences, 425-440 (1991).
20. S. Plotkin, E. Taxdos: Improved bounds on the max-flow min-cut ratio for multicommodity flows. 25 th ACM Symposium on Theory of Computing (1993).
21. A. Schrijver: Homotopic routing methods. In: B. Korte, L. Lovasz, H.J. Promel, A. Schrijver (eds.): Paths, Flows and VLSI-Layout. Algorithms and Combinatorics 9, Springer, pp. 329-371, 1990.
22. W. T. Tutte: An algorithm for determining whether a given binary matroid is graphic. Proc. Amer. Math. Soc. 11, 905-917 (1960).
23. r,r-free graphs, submitted for publication (1992).
24. D.P. Williamson, M.X. Goemans, M. Mihail, V.V. Vazirani: A primal-dual approximation algorithm for generalized steiner network problems. 25 th ACM Symposium on Theory of Computing (1993).