Approximation Algorithms for Steiner and Directed Multicuts

Journal of Algorithms

Volumn 22, Issue 2, 1997, Pages 241-269

  Klein, Philip N ^a   Plotkin, Serge A ^a   Rao, Satish ^a   Tardos, Éva ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0000430409     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.1996.0833     Document Type: Article

References (19)

1. B. Awerbuch, A. Bar-Nov, N. Linial, and D. Peleg, Improved routing strategies with succinct tables, J. Algorithms 11 (1990), 307-341.
2. B. Awerbuch, A. V. Goldberg, M. Luby, and S. A. Plotkin, Network Decomposition and Locality in Distributed Computation, in "Proc. 30th IEEE Annual Symposium on Foundations of Computer Science, 1989," pp. 364-369.
3. B. Awerbuch and D. Peleg, Network synchronization with polylogarithmic overhead, in "Proc. 31st IEEE Annual Symposium on Foundations of Computer Science, 1990," pp. 514-522.
4. G. Even, J. Naor, B. Schieber, and M. Sudan, Approximating minimum feedback sets and multi-cuts in directed graphs, in "Proc. 4th Conference on Integer Programming and Combinatorial Optimization, 1995," pp. 14-28.
5. N. Garg, V. V. Vazirani, and M. Yannakakis, Approximate max-flow min-(multi)cut theorems and their applications, in "Proc. 25th Annual ACM Symposium on Theory of Computing, May 1993."
6. M. X. Goemans and D. P. Williamson, A new 3/4-approximation algorithm for MAX SAT, in "Proc. Third Conference on Integer Programming and Combinatorial Optimization, (1993)," pp. 313-322.
7. D. S. Johnson, Approximation algorithms for combinatorial problems, J. Comp. Syst. Sci., 9, 256-278.
8. N. Kahale, On reducing the cut ratio to the multicut problem, unpublished manuscript, 1993.
9. P. N. Klein, S. Rao, A. Agrawal, and R. Ravi, An approximate max-flow min-cut relation for multicommodity flow, with applications, Combinatorica 15(2) (1995), 187-202.
10. T. Leighton and S. Rao, An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms, in "Proc. 29th IEEE Annual Symposium on Foundations of Computer Science, 1988," pp. 422-431.
11. D. Peleg and E. Upfal, A tradeoff between size and efficiency for routing tables, J. ACM 36 (1989), 510-530.
12. S. Plotkin and É. Tardos, Improved bounds on the max-flow min-cut ratio for multi-commodity flows, Combinatorica, 15(3) (1995) 425-434.
13. S. A. Plotkin, D. Shmoys, and É. Tardos, Fast approximation algorithms for fractional packing and covering, "Mathematics of Operations Research," 1995, Vol. 20(2), pp. 257-301.
14. T. Radzik, Fast deterministic approximation for the multicommodity flow problem, in "Proc. 6th Annual ACM-SIAM Symposium on Discrete Algorithms, 1995."
15. D. B. Shmoys, Cut problems and their application to divide-and-conquer, in Approximation Algorithms (D. S. Hochbaum, Ed.), PWS, Boston, 1995, pp. 192-231.
16. D. B. Shmoys, Computing near-optimal solutions to combinatorial optimization problems, in Advances in Combinatorial Optimization (W. Cook, L. Lovász, P. Seymour, Eds.), AMS, Providence, RI, 1995, pp. 355-397.
17. P. D. Seymour, Packing directed circuits fractionally, Combinatorica, 15(2) (1995), 281-288.
18. P. M. Vaidya, A new algorithm for minimizing convex functions over convex sets, in "Proceedings of the 30th Annual IEEE Symposium on Foundations of Computer Science, 1989," pp. 338-343.
19. M. Yannakakis, On the approximation of maximum satisfiability, in "Proc. 3rd ACM-SIAM Symposium on Discrete Algorithms, 1992," pp. 1-9.