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 (2002). A quantitatively stronger version of the conjecture implies an inapproximability factor of \(\Omega(\sqrt{\log \log n}).\)
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
Author information
Authors and Affiliations
Corresponding author
Additional information
Manuscript received 19 September 2005
Rights and permissions
Open Access This is an open access article distributed under the terms of the Creative Commons Attribution Noncommercial License ( https://creativecommons.org/licenses/by-nc/2.0 ), which permits any noncommercial use, distribution, and reproduction in any medium, provided the original author(s) and source are credited.
About this article
Cite this article
Chawla, S., Krauthgamer, R., Kumar, R. et al. ON THE HARDNESS OF APPROXIMATING MULTICUT AND SPARSEST-CUT. comput. complex. 15, 94–114 (2006). https://doi.org/10.1007/s00037-006-0210-9
Issue Date:
DOI: https://doi.org/10.1007/s00037-006-0210-9