An improved approximation algorithm for requirement cut

Operations Research Letters

Volumn 38, Issue 4, 2010, Pages 322-325

  Gupta, Anupam ^a   Nagarajan, Viswanath ^b   Ravi, R ^c  

^a Carnegie Mellon University   (United States)

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

^c CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

Approximation algorithms; Graph partitioning

Indexed keywords

APPROXIMATION RATIOS; EDGE-WEIGHTED GRAPH; GENERAL GRAPH; GRAPH PARTITIONING; MINIMUM COST; UNDERLYING GRAPHS;

GRAPH THEORY; TREES (MATHEMATICS);

APPROXIMATION ALGORITHMS;

EID: 77955309248     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.orl.2010.02.009     Document Type: Article

References (9)

1. A. Avidor, and M. Langberg The multi-multiway cut problem Theoretical Computer Science 377 13 2007 35 42
2. Chandra Chekuri, and Sudipto Guha The Steiner k -cut problem SIAM Journal on Discrete Mathematics 20 1 2006 261 271
3. E. Dahlhaus, D.S. Johnson, C.H. Papadimitriou, P.D. Seymour, and M. Yannakakis The complexity of multiterminal cuts SIAM Journal on Computing 23 4 1994 864 894
4. J. Fakcharoenphol, S. Rao, and K. Talwar A tight bound on approximating arbitrary metrics by tree metrics Journal of Computer and System Sciences 69 3 2004 485 497
5. Philip N. Klein, Serge A. Plotkin, Satish Rao, and Eva Tardos Approximation algorithms for Steiner and directed multicuts Journal of Algorithms 22 2 1997 241 269
6. P.N. Klein, S. Rao, A. Agarwal, and R. Ravi An approximate max-flow min-cut relation for multicommodity flow, with applications Combinatorica 15 1995 187 202
7. Ankur Moitra, Approximation algorithms for multicommodity-type problems with guarantees independent of the graph size, in: Proceedings of FOCS, 2009.
8. Viswanath Nagarajan, and R. Ravi Approximation algorithms for requirement cut on graphs Algorithmica 56 2 2010 198 213
9. Huzur Saran, and Vijay V. Vazirani Finding k cuts within twice the optimal SIAM Journal on Computing 24 1 1995 101 108