Polynomial flow-cut gaps and hardness of directed cut problems

Journal of the ACM

Volumn 56, Issue 2, 2009, Pages

  Chuzhoy, Julia ^a   Khanna, Sanjeev ^b  

^a TOYOTA TECHNOLOGICAL INSTITUTE AT CHICAGO   (United States)

^b UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

Directed multicut; Hardness of approximation; Sparsest cut

Indexed keywords

CARDINALITIES; DIRECTED ACYCLIC GRAPHS; DIRECTED GRAPHS; DIRECTED MULTICUT; HARDNESS OF APPROXIMATION; HARDNESS RESULT; INTEGRALITY GAPS; LINEAR PROGRAMMING RELAXATION; LOWER BOUNDS; LP-RELAXATION; MAXIMUM CONCURRENT FLOW; MAXIMUM FLOWS; MINIMUM COST; MINIMUM MULTICUT; MULTI-COMMODITY FLOW; MULTICUTS; N-VERTEX GRAPH; POLYNOMIAL FACTOR; SHARP CONTRAST; SOURCE-SINK; SPARSEST CUT;

CONTROL THEORY; DYNAMIC PROGRAMMING; HARDNESS; LINEARIZATION; POLYNOMIAL APPROXIMATION;

GRAPH THEORY;

EID: 70349972685     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/1502793.1502795     Document Type: Conference Paper

References (27)

1. Agarwal, A., Alon,N., and Charikar, M. S. 2007. Improved approximation for directed cut problems. In STOC '07: Proceedings of the 39th Annual ACM Symposium on Theory of Computing. ACM, New York, 671-680.
2. Alimonti,P., and Kann, V 1997. Hardness of approximating problems on cubic graphs. In CIAC '97: Proceedings of the 3rd Italian Conference on Algorithms and Complexity. Springer-Verlag, Berlin, Germany, 288-298.
3. Ambühl, C., Mastrolilli,M., and Svensson, O. 2007. Inapproximability results for sparsest cut, optimal linear arrangement, and precedence constrained scheduling. In FOCS '07: Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science. IEEE Computer Society, Press, Los Alamitos, CA, 329-337.
4. Andrews,M., and Zhang, L. 2006. Logarithmic hardness of the directed congestion minimization problem. In STOC' 06: Proceedings of the thirty-eighth annual ACM symposium on Theory of computing. ACM, New York, 517-526. (Pubitemid 44306586)
5. Arora, S., Lee,J.R., and Naor, A. 2005. Euclidean distortion and the sparsest cut. In STOC '05: Proceedings ofthe 37th Annual ACM Symposium on Theory ofComputing. ACM, New York, 553-562.
6. Arora, S., Rao, S., and Vazirani, U. 2004. Expander flows, geometric embeddings and graph partitioning. In STOC ' 04: Proceedings of the 36th Annual ACM Symposium on Theory of Computing. ACM, New York, 222-231.
7. Bellare, M., Goldwasser, S., Lund,C., and Russeli, A. 1993. Efficient probabilistically checkable proofs and applications to approximations. In STOC' 93: Proceedings of the 25 th Annual ACM Symposium on Theory ofComputing. ACM, New York, 294-304.
8. Charikar, M., Makarychev, K., and Makarychev, Y. 2006. Directed metrics and directed graph partitioning problems. In SODA ' 06: Proceedings of the 17th Annual ACM-SIAM Symposium onDiscrete Algorithm. ACM, New York, 51-60.
9. Chawla, S., Krauthgamer, R., Kumar, R., Rabani,Y., and Sivakumar, D. 2006. On the hardness of approximating multicutand sparsest-cut. Comput. Complex. 15, 2, 94-114.
10. Cheriyan, J., Karloff, H., and Rabani, Y. 2005. Approximating directed multicuts. Combinator-ica 25, 3, 251-269.
11. Chuzhoy, J., Guruswami, V, Khanna, S., and Talwar, K. 2007. Hardness of routing with congestion in directed graphs. In STOC 07: Proceedings of the 39th Annual ACM Symposium on Theory of Computing. ACM, New York, NY, USA, 165-178.
12. Chuzhoy,J., and Khanna, S. 2006a. Hardness of cut problems in directed graphs. In STOC '06: Proceedings of the 38th Annual ACM Symposium on Theory of Computing. ACM, New York, 527-536.
13. Chuzhoy,J., and Khanna, S. 2006b. Hardness of directed routing with congestion. ECCC Technical Report TR06-109.
14. Dahlhaus, E., Johnson, D. S., Papadimitriou, C. H., Seymour,P. D., and Yannakakis, M. 1994. The complexity of multiterminal cuts. SIAM J. Comput. 23, 4, 864-894.
15. Dinur, I., Fischer, E., Kindler, G., Raz,R., and Safra, S. 1999. Pcp characterizations of np: towards a polynomially-small error-probability. In STOC '99: Proceedings of the 31st Annual ACM Symposium on Theory of Computing. ACM, New York, 29-110
16. Feige, U. 2002. Relations between average case complexity and approximation complexity. In CCC '02: Proceedings of the 17th IEEE Annual Conference on Computational Complexity. IEEE Computer Society Press, Los Alamitos, CA, 5. (Pubitemid 34691877)
17. Feige,U., and Kogan, S. 2004. Hardness of approximation of the balanced complete bipartite subgraph problem. Tech. Rep. Technical Report MCS04-04, Department of Computer Science and Applied Math., The Weizmann Institute of Science, Haifa, Israel.
18. Ford,L., and Fulkerson, D. 1962. Flows in networks. Princeton University Press, Princeton, NJ.
19. Garg, N., Vazirani,V V, and Yannakakis, M. 1996. Approximate max-flow min-(multi)cut theorems and their applications. SIAM J. Comput. 25, 698-707.
20. Gupta, A. 2003. Improved results for directed multicut. In SODA '03: Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics, Philadelphia, PA, 454-455.
21. Guruswami,V, and Talwar, K. 2006. Hardness of low congestion routing in directed graphs. ECCC Technical Report TR06-141.
22. Hajiaghayi,M.T., and RAcke, H. 2006. An o(√n)-approximation algorithm for directed sparsest cut. Inf. Process. Lett. 97, 4, 156-160.
23. Khot, S. 2002. On the power of unique 2-prover 1-round games. In STOC ' 02: Proceedings of the 34th Annual ACM Symposium on Theory of Computing. ACM, New York, 767-775. (Pubitemid 35009440)
24. Khot, S. A., and Vishnoi, N. K. 2005. The unique games conjecture, integrality gap for cut problems and embeddability of negative type metrics into l1 .In FOCS ' 05: Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, CA, 53-62.
25. Kortsarts, Y., Kortsarz, G., and Nutov, Z. 2005. Greedy approximation algorithms for directed multicuts. Networks 45, 4, 214-217. (Pubitemid 40948520)
26. Leighton,T., and Rao, S. 1999. Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms. J. ACM 46, 6, 787-832.
27. Saks, M., Samorodnitsky, A., and Zosin, L. 2004. A lower bound on the integrality gap for minimum multicut in directed networks. Combinatorica 24, 3, 525-530.