This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy: Proof verification and the hardness of approximation problems. Proc. 33rd IEEE Symp. on Foundations of Computer Science, 14–23 (1992).
R. Bar-Yehuda, S. Even: A linear time approximation algorithm for the weighted vertex cover problem. J. Algorithms 2, 198–203 (1981).
R.E. Bixby, D.K. Wagner: An almost linear time algorithm for graph realization. Mathematics of Operations Research 13, 99–123 (1988)
S. Chopra, M.R. Rao: On the multiway cut polyhedron. Networks 21, 51–89 (1991).
E. Dalhaus, D.S. Johnson, C.H. Papadimitriou, P.D. Seymour, M. Yannakakis: The complexity of multiway cuts. Proc. 24th ACM Symposium on Theory of Computing (1992).
J. Edmonds: Maximum matching and a polyhedron with (0,1) vertices. J. Res. Nat. Bur. Standards Sect. B 69B, 125–130 (1965).
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.
M. Grotschel, L. Lovasz, A. Schrijver: The ellipsoid method and its consequences in combinatorial optimization. Combinatorica 1, 169–197 (1981).
N. Garg, V.V. Vazirani, M. Yannakakis: Approximate max-flow min-(multi)cut theorems and their applications. 25th ACM Symposium on Theory of Computing (1993).
M.X. Goemans, D.P. Williamson: A general approximation technique for constrained forest problems. 3rd Annual ACM-SIAM Symposium on Discrete Algorithms (1992).
V. Kann. On the approximability of NP-complete optimization problems. Ph.D. Thesis, Royal Institute of Technology, Stockholm, 1992.
P. Klein, A. Agrawal, R. Ravi, S. Rao: Approximation through multicommodity flow. 31st Symposium on Foundations of Computer Science, 726–737 (1990).
P. Klein, S. Plotkin, S. Rao: Excluded minors, network decomposition, and multicommodity flow. 25th ACM Symposium on Theory of Computing (1993).
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.
F.T. Leighton, S. Rao: An approximate max-flow min-cut theorem for uniform multicommodity flow problems with application to approximation algorithms. 29th Symposium on Foundations of Computer Science, 422–431 (1988).
C. Lund, M. Yannakakis: On the hardness of approximating minimization problems. 25th ACM Symposium on Theory of Computing (1993).
W.R. Pulleyblank: Faces of matching polyhedra. Ph.D. Thesis: Univ. of Waterloo: Dept. Combinatorics and Optimization, 1973.
C.H. Papadimitriou, K. Steiglitz: Combinatorial Optimization: Algorithms and Complexity. New Jersey: Prentice Hall Inc., 1982.
C. H. Papadimitriou, and M. Yannakakis. Optimization, approximation and complexity classes. J. of Computer and System Sciences, 425–440 (1991).
S. Plotkin, E. Tardos: Improved bounds on the max-flow min-cut ratio for multicommodity flows. 25th ACM Symposium on Theory of Computing (1993).
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.
W. T. Tutte: An algorithm for determining whether a given binary matroid is graphic. Proc. Amer. Math. Soc. 11, 905–917 (1960).
E. Tardos, V.V. Vazirani: Improved bounds for the max-flow min-multicut ratio for planar and K r,r -fiee graphs. submitted for publication (1992).
D.P. Williamson, M.X. Goemans, M. Mihail, V.V. Vazirani: A primal-dual approximation algorithm for generalized steiner network problems. 25th ACM Symposium on Theory of Computing (1993).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Garg, N., Vazirani, V.V., Yannakakis, M. (1993). Primal-dual approximation algorithms for integral flow and multicut in trees, with applications to matching and set cover. In: Lingas, A., Karlsson, R., Carlsson, S. (eds) Automata, Languages and Programming. ICALP 1993. Lecture Notes in Computer Science, vol 700. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56939-1_62
Download citation
DOI: https://doi.org/10.1007/3-540-56939-1_62
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56939-8
Online ISBN: 978-3-540-47826-3
eBook Packages: Springer Book Archive