Approximation algorithms for the 0-extension problem

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2001, Pages 8-16

  Calinescu, Gruia ^a   Karloff, Howard ^b,c   Rabani, Yuval ^d  

^a Illinois Institute of Technology   (United States)

^b ATandT Labs Research   (United States)

^c Georgia Institute of Technology   (United States)

^d TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Algorithms; Theory; Verification

Indexed keywords

EID: 33748111924     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (17)

1. Yair Bartal, On approximating arbitrary metrices by tree metrics, Proceedings of the thirtieth annual ACM symposium on Theory of computing, p.161-168, May 24-26, 1998, Dallas, Texas, United States [doi〉10.1145/ 276698.276725]
2. Gruia Cǎlinescu, Howard Karloff, Yuval Rabani, An improved approximation algorithm for MULTIWAY CUT, Journal of Computer and System Sciences, v.60 n.3, p.564-574, June 2000 [doi〉10.1006/jcss.1999.1687 ]
3. William H. Cunningham , Lawrence Tang, Optimal 3-Terminal Cuts and Linear Programming, Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization, p.114-125, June 09-11, 1999
4. J. Chuzhoy. Private communication, 1999.
5. E. Dahlhaus, D. S. Johnson, C. H. Papadimitriou, P. D. Seymour, and M. Yannakakis. The complexity of multiway cuts. Extended abstract, 1983.
6. E. Dahlhaus , D. S. Johnson, C. H. Papadimitriou, P. D. Seymour, M. Yannakakis, The complexity of multiway cuts (extended abstract), Proceedings of the twenty-fourth annual ACM symposium on Theory of computing, p.241-251, May 04-06, 1992, Victoria, British Columbia, Canada [doi〉10.1145/129712.129736]
7. Naveen Garg, Vijay V. Vazirani, Mihalis Yannakakis, Primal-Dual Approximation Algorithms for Integral Flow and Multicut in Trees, with Applications to Matching and Set Cover, Proceedings of the 20th International Colloquium on Automata, Languages and Programming, p.64-75, July 05-09, 1993
8. Naveen Garg , Vijay V. Vazirani , Mihalis Yannakakis, Approximate max-flow min-(multi) cut theorems and their applications, Proceedings of the twenty-fifth annual ACM symposium on Theory of computing, p.698-707, May 16-18, 1993, San Diego, California, United States [doi〉10.1145/167088.167266]
9. Anupam Gupta , Éva Tardos, A constant factor approximation algorithm for a class of classification problems, Proceedings of the thirty-second annual ACM symposium on Theory of computing, p.652-658, May 21-23, 2000, Portland, Oregon, United States [doi〉10.1145/335305.335397]
10. David R. Karger , Philip Klein , Cliff Stein , Mikkel Thorup , Neal E. Young, Rounding algorithms for a geometric embedding of minimum multiway cut, Proceedings of the thirty-first annual ACM symposium on Theory of computing, p.668-678, May 01-04, 1999, Atlanta, Georgia, United States [doi〉10.1145/ 301250.301430]
11. Alexander V. Karzanov, Minimum 0-extensions of graph metrics, European Journal of Combinatorics, v.19 n.1, p.71-101, Jan., 1998 [doi〉10.1006/eujc. 1997.0154]
12. P. Klein, A. Agarwal, R.. Rgvi, and S. Rao. Approximation through multicommodity flow. In Proc. FOCS '90, pages 726-737.
13. Philip Klein, Serge A. Plotkin, Satish Rao, Excluded minors, network decomposition, and multicommodity flow, Proceedings of the twenty-fifth annual ACM symposium on Theory of computing, p.682-690, May 16-18, 1993, San Diego, California, United States [doi〉10.1145/167088.167261]
14. Jon Kleinberg, Eva Tardos, Approximation Algorithms for Classification Problems with Pairwise Relationships: Metric Labeling and Markov Random Fields, Proceedings of the 40th Annual Symposium on Foundations of Computer Science, p.14, October 17-18, 1999
15. F. T. Leighton and S. Ftao. An approximate maxflow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms. In Proc. FOCS'88, pages 422-431.
16. A. Lubotzky, Ft.. Phillips, and P. Sarnak. Ramanujan graphs. Combinalorica 8:261-277, 1988.
17. Éva Tardos, Vijay V. Vazirani, Improved bounds for the max-flow min-multicut ratio for planar and Kr,r-free graphs, Information Processing Letters, v.47 n.2, p,77-80, Aug. 20, 1993 [doi〉10.1016/0020-0190(93)90228- 2]