The Community for Technology Leaders
20th Annual IEEE Conference on Computational Complexity (CCC'05) (2005)
San Jose, CA
June 11, 2005 to June 15, 2005
ISSN: 1093-0159
ISBN: 0-7695-2364-1
pp: 144-153
Shuchi Chawla , Carnegie Mellon University
Robert Krauthgamer , IBM Almaden Research Center
Ravi Kumar , IBM Almaden Research Center
Yuval Rabani , Technion-Israel Institute of Technology, Cornell University, IBM Almaden Research Center and University of California at Los Angeles
D. Sivakumar , IBM Almaden Research Center
ABSTRACT
We show that the MULTICUT, SPARSEST-CUT, and MIN-2CNF ≣ DELETION problems are NP-hard to approximate within every constant factor, assuming the Unique Games Conjecture of Khot [STOC, 2002]. A quantitatively stronger version of the conjecture implies inapproximability factor of Ω(log log n).
INDEX TERMS
null
CITATION

R. Krauthgamer, Y. Rabani, S. Chawla, D. Sivakumar and R. Kumar, "On the Hardness of Approximating Multicut and Sparsest-Cut," 20th Annual IEEE Conference on Computational Complexity (CCC'05)(CCC), San Jose, CA, 2005, pp. 144-153.
doi:10.1109/CCC.2005.20
94 ms
(Ver 3.3 (11022016))