An O(√n-approximation algorithm for directed sparsest cut

Information Processing Letters

Volumn 97, Issue 4, 2006, Pages 156-160

  Hajiaghayi, Mohammad Taghi ^a   Räcke, Harald ^b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b Carnegie Mellon University   (United States)

Author keywords

Approximation algorithms; Directed graphs; Multicommodity flow; Sparsest cut

Indexed keywords

ALGORITHMS; CONCURRENCY CONTROL; GRAPH THEORY; PROBLEM SOLVING;

APPROXIMATION ALGORITHMS; DIRECTED GRAPHS; MULTICOMMODITY FLOW; SPARSEST CUT;

APPROXIMATION THEORY;

EID: 29344450627     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2005.10.005     Document Type: Article

References (12)

1. A. Agarwal, M. Charikar, K. Makarychev, Y. Makarychev, O (log n ) -approximation algorithms for Min Uncut, Min 2CNF Deletion, and directed cut problems, in: Proc. 37th ACM Symp. on Theory of Computing (STOC), 2005, pp. 573-581
2. S. Arora, S. Rao, U. Vazirani, Expander flows, geometric embeddings, and graph partitionings, in: Proc. 36th ACM Symp. on Theory of Computing (STOC), 2004, pp. 222-231
3. S. Chawla, A. Gupta, H. Räcke, An improved approximation to sparsest cut, in: Proc. 16th ACM-SIAM Symp. on Discrete Algorithms (SODA), 2005, pp. 102-111
4. J. Cheriyan, H. Karloff, Y. Rabani, Approximating directed multicuts, in: Proc. 4nd IEEE Symp. on Foundations of Computer Science (FOCS), 2001, pp. 320-328
5. M.-C. Costa, L. Létocart, and F. Roupin Minimal multicut and maximal integer multiflow: A survey J. Oper. Res. 162 1 2005 55 59
6. A. Gupta, Improved results for directed multicut, in: Proc. 14th ACM-SIAM Symp. on Discrete Algorithms (SODA), 2003, pp. 454-455
7. M.T. Hajiaghayi, F.T. Leighton, On the max-flow min-cut ratio for directed multicommodity flows, Technical Report MIT-LCS-TR-910, Massachusetts Institute of Technology, Cambridge, MA, USA, July 2003
8. Y. Kortsarts, G. Kortsarz, and Z. Nutov Greedy approximation algorithms for directed multicuts Networks 45 4 2005 214 217
9. F.T. Leighton, and S.B. Rao Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms J. ACM 46 6 1999 787 832
10. D.B. Shmoys Cut problems and their application to divide-and-conquer D.S. Hochbaum Approximation Algorithms for NP-Hard Problems 1997 PWS Publishing Warsaw 192 235
11. M. Saks, A. Samorodnitsky, and L. Zosin A lower bound on the integrality gap for minimum multicut in directed networks Combinatorica 24 3 2004 525 530
12. K.R. Varadarajan, G. Venkataraman, Graph decomposition and a greedy algorithm for edge-disjoint paths, in: Proc. 15th ACM-SIAM Symposium on Discrete Algorithms (SODA), 2004, pp. 379-380