Hardness of cut problems in directed graphs

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn 2006, Issue , 2006, Pages 527-536

  Chuzhoy, Julia ^a   Khanna, Sanjeev ^a  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

Directed Multicut; Hardness of Approximation; Sparsest cut

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; PROBLEM SOLVING;

DIRECTED MULTICUT; HARDNESS OF APPROXIMATION; SPARSEST CUT;

GRAPH THEORY;

EID: 33748101378     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1132516.1132593     Document Type: Conference Paper

References (23)

1. P. Alimonti and V. Kann. Hardness of approximating problems on cubic graphs, Theoretical Computer Science, 237: 123-134, 2000.
2. S. Arora, J. R. Lee, A. Naor, Euclidean distortion and the sparsest cut. In Proc. of STOC, 2005, pp. 553-562.
3. S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy. Proof verification and the hardness of approximation problems. Journal of the ACM, 45(3):501-555, 1998.
4. S. Arora, S. Rao, U. V. Vazirani. Expander flows, geometric embeddings and graph partitioning. In Proc. of STOC, 2004, pp. 222-231.
5. S. Arora and S. Safra. Probabilistic checking of proofs: A new characterization of NP. JACM, 45(1):70-122, 1998.
6. M. Charikar, K. Makarychev, Y. Makarychev, Directed Metrics and Directed Graph Partitioning Problems. In Proc. of SODA, 2006, pp. 51-60.
7. S. Chawla, R. Krauthgamer, R. Kumar, Y. Rabani, D. Sivakumar. On the Hardness of Approximating Multicut and Sparsest-Cut, in Proc. IEEE Conference on Computational Complexity, 2005, pp. 144-153.
8. J. Cheriyan, H. J. Karloff, Y. Rabani. Approximating Directed Multicuts. In Proc. of FOCS, 2001, pp. 320-328.
9. E. Dahlhaus, D. S. Johnson, C. H. Papadimitriou, P. D. Seymour, M. Yannakakis, The Complexity of Multiterminal Cuts. In SIAM J. Comput., 23(4): 864-894, 1994.
10. U. Feige, Relations between average case complexity and approximation complexity, In Proc. of STOC, 2002, pp. 534-543.
11. U. Feige and S. Kogan, Hardness of Approximation of the Balanced Complete Bipartite Subgraph Problem. Technical Report MCS04-04, Department of Computer Science and Applied Math., The Weizmann Institute of Science, 2004.
12. L. R. Ford, D. R. Fulkerson, 1962. Flows in Networks. Princeton University Press, Princeton, NJ.
13. N. Garg, V. Vazirani, M. Yannakakis. Approximate max-flow min-(multi)cut theorems and their applications. In Proc. of STOC, 1993, pp. 698-707.
14. N. Garg, V. Vazirani, M. Yannakakis. Primal-Dual Approximation Algorithms for Integral Flow and Multicut in Trees. Algorithmica, 18(1):3-20, 1997.
15. Preliminary version in Proc. of ICALP, 1993.
16. A. Gupta. Improved results for directed multicut. In Proc. of SODA, 2003, pp. 454-455.
17. M.T. Hajiaghayi, H. Räcke. An O(√n)-Approximation Algorithm For Directed Sparsest Cut, Information Processing Letters, 97(4): 156-160, 2006.
18. S. Khot, On the power of unique 2-prover 1-round games. In Proc. of STOC, 2002, pp. 767-775.
19. 1. In Proc. of FOCS, 2005, pp. 53-62.
20. T. Leighton and S. Rao. Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms. JACM, 46(6):787-832, 1999.
21. Preliminary version in Proc. of FOCS, 1988.
22. R. Raz. A parallel repetition theorem. SIAM J. of Computing, 27(3):763-803, 1998.
23. M. E. Saks, A. Samorodnitsky, L. Zosin. A Lower Bound On The Integrality Gap For Minimum Multicut In Directed Networks, Combinatorica 24(3); 525-530 (2004).