On the hardness of approximating multicut and sparsest-cut

Computational Complexity

Volumn 15, Issue 2, 2006, Pages 94-114

  Chawla, Shuchi ^a   Krauthgamer, Robert ^b   Kumar, Ravi ^b,d   Rabani, Yuval ^c   Sivakumar, D ^b,e  

^a Carnegie Mellon University   (United States)

^b IBM ALMADEN RESEARCH CENTER   (United States)

^c TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^d YAHOO RESEARCH   (United States)

^e GOOGLE INC   (United States)

Author keywords

Fourier analysis; Multicut; Sparsest cut; Unique games conjecture

Indexed keywords

EID: 33745302806     PISSN: 10163328     EISSN: 14208954     Source Type: Journal    
DOI: 10.1007/s00037-006-0210-9     Document Type: Conference Paper

References (35)

1. A. AGARWAL, M. CHARIKAR, K. MAKARYCHEV & Y. MAKARYCHEV (2005). O(√log n) approximation algorithms for Min UnCut, Min 2CNF Deletion, and directed cut problems. In Proc. 37th Annual ACM Symposium on Theory of Computing, 573-581.
2. S. ARORA, J. R. LEE & A. NAOR (2005). Euclidean distortion and the sparsest cut. In Proc. 37th Annual ACM Symposium on Theory of Computing, 553-562.
3. S. ARORA, C. LUND, R. MOTWANI, M. SUDAN & M. SZEGEDY (1998). Proof verification and the hardness of approximation problems. J. ACM 45, 501-555.
4. S. ARORA, S. RAO & U. VAZIRANI (2004). Expander flows, geometric embeddings, and graph partitionings. In Proc. 36th Annual ACM Symposium on Theory of Computing, 222-231.
5. S. ARORA & S. SAFRA (1998). Probabilistic checking of proofs: A new characterization of NP. J. ACM 45, 70-122.
6. Y. AUMANN & Y. RABANI (1998). An O(log k) approximate min-cut max-flow theorem and approximation algorithm. SIAM J. Comput. 27, 291-301.
7. N. BANSAL, A. BLUM & S. CHAWLA (2004). Correlation clustering. Machine Learning 56, Special Issue on Clustering, 89-113.
8. M. BELLARE, O. GOLDREICH & M. SUDAN (1998). Free bits, PCP's and non-approximability - towards tight results. SIAM J. Comput. 27, 804-915.
9. M. BEN-OR & N. LINIAL (1989). Collective coin flipping. In Randomness and Complication, S. Micali (ed.), JAI Press, 91-115.
10. M. CHARIKAR, V. GURUSWAMI & A. WIRTH (2003). Clustering with qualitative information. In Proc. 44th IEEE Symposium on Foundations of Computer Science, 524-533.
11. M. CHARIKAR, K. MAKARYCHEV & Y. MAKARYCHEV (2006). Near-optimal algorithms for Unique Games. In Proc. 38th Annual ACM Symposium on Theory of Computing, to appear.
12. S. CHAWLA, A. GUPTA & H. RÄCKE (2005a). Improved approximations to sparsest cut. In Proc. 16th Annual ACM-SIAM Symposium on Discrete Algorithms, 102-111.
13. S. CHAWLA, R. KRAUTHGAMER, R. KUMAR, Y. RABANI & D. SIVAKUMAR (2005b). On the hardness of approximating multicut and sparsest-cut. In Proc. 20th Annual IEEE Conference on Computational Complexity, 144-153.
14. E. DAHLHAUS, D. S. JOHNSON, C. H. PAPADIMITRIOU, P. D. SEYMOUR & M. YAN-NAKAKIS (1994). The complexity of multiterminal cuts. SIAM J. Comput. 23, 864-894.
15. E. DEMAINE & N. IMMORLICA (2003). Correlation clustering with partial information. In Proc. 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), 1-13.
16. N. DEVANUR, S. KHOT, R. SAKET & N. VISHNOI (2006). Integrality gaps for sparsest cut and minimum linear arrangement problems. In Proc. 38th Annual ACM Symposium on Theory of Computing, to appear.
17. D. EMANUEL & A. FIAT (2003). Correlation clustering - minimizing disagreements on arbitrary weighted graphs. In Proc. 11th Annual European Symposium on Algorithms, 208-220.
18. U. FEIGE & D. REICHMAN (2004). On systems of linear equations with two variables per equation. In Proc. 7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), 117-127.
19. E. FRIEDGUT (1998). Boolean functions with low average sensitivity depend on few coordinates. Combinatorica 18, 27-35.
20. N. GARG, V. V. VAZIRANI & M. YANNAKAKIS (1996). Approximate max-flow min-(multi)cut theorems and their applications. SIAM J. Comput. 25, 235-251.
21. A. GUPTA & K. TALWAR (2006). Approximating unique games. In Proc. 17th Annual ACM-SIAM Symposium on Discrete Algorithms, 99-106.
22. J. HÅSTAD (2001). Some optimal inapproximability results. J. ACM 48, 798-859.
23. J. KAHN, G. KALAI & N. LINIAL (1988). The influence of variables on Boolean functions. In Proc. 29th IEEE Symposium on Foundations of Computer Science, 68-80.
24. S. KHOT (2002). On the power of unique 2-prover 1-round games. In Proc. 34th Annual ACM Symposium on Theory of Computing, 767-775.
25. S. KHOT, G. KINDLER, E. MOSSEL & R. O'DONNELL (2004). Optimal inapproximability results for MAX-CUT and other 2-variable CSPs. In Proc. 45th IEEE Symposium on Foundations of Computer Science, 146-154. See also ECCC Report TR05-101, 2005.
26. S. KHOT & O. REGEV (2003). Vertex cover might be hard to approximate to within 2-∈. In Proc. 18th Annual IEEE Conference on Computational Complexity, 379-386.
27. 1. In Proc. 46th IEEE Symposium on Foundations of Computer Science, 53-62.
28. P. KLEIN, A. AGRAWAL, R. RAVI & S. RAO (1990). Approximation through multicommodity flow. In Proc. 31st IEEE Symposium on Foundations of Computer Science, 726-737.
29. 1. In Proc. 17th Annual ACM-SIAM Symposium on Discrete Algorithms, ACM, 1010-1017.
30. F. T. LEIGHTON & S. RAO (1988). An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms. In Proc. 29th IEEE Symposium on Foundations of Computer Science, 422-431.
31. N. LINIAL, E. LONDON & Y. RABINOVICH (1995). The geometry of graphs and some of its algorithmic applications. Combinatorics, 15, 215-245.
32. E. MOSSEL, R. O'DONNELL & K. OLESZKIEWICZ (2005). Noise stability of functions with low influences: Invariance and optimality. In Proc. 46th IEEE Symposium on Foundations of Computer Science, 21-30.
33. R. RAZ (1998). A parallel repetition theorem. SIAM J. Comput. 27, 763-803.
34. L. TREVISAN (2005). Approximation algorithms for unique games. In Proc. 46th IEEE Symposium on Foundations of Computer Science, 197-205. See also comment for ECCC TR05-34.
35. V. V. VAZIRANI (2001). Approximation Algorithms. Springer, Berlin.