On the hardness of approximating multicut and sparsest-cut

Shuchi Chawla*, Robert Krauthgamer, Ravi Kumar, Yuval Rabani, D. Sivakumar

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

54 Scopus citations

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).

Original languageAmerican English
Title of host publicationProceedings of the 20th Annual IEEE Conference on Computational Complexity
Pages144-153
Number of pages10
DOIs
StatePublished - 2005
Externally publishedYes
Event20th Annual IEEE Conference on Computational Complexity - San Jose, CA, United States
Duration: 11 Jun 200515 Jun 2005

Publication series

NameProceedings of the Annual IEEE Conference on Computational Complexity
ISSN (Print)1093-0159

Conference

Conference20th Annual IEEE Conference on Computational Complexity
Country/TerritoryUnited States
CitySan Jose, CA
Period11/06/0515/06/05

Fingerprint

Dive into the research topics of 'On the hardness of approximating multicut and sparsest-cut'. Together they form a unique fingerprint.

Cite this