On the hardness of approximating multicut and sparsest-cut

Shuchi Chawla; Robert Krauthgamer; Ravi Kumar; Yuval Rabani; D. Sivakumar

doi:10.1007/s00037-006-0210-9

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: Contribution to journal › Article › peer-review

152 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 (2002). A quantitatively stronger version of the conjecture implies an inapproximability factor of Ω(√log log n).

Original language	English
Pages (from-to)	94-114
Number of pages	21
Journal	Computational Complexity
Volume	15
Issue number	2
DOIs	https://doi.org/10.1007/s00037-006-0210-9
State	Published - Jun 2006
Externally published	Yes

Bibliographical note

Funding Information:
We thank the anonymous referees for useful comments, and in particular for suggesting a simplification of our original proof of Lemma 3.1. Part of this work was done while Shuchi Chawla was visiting IBM Almaden Research Center. Part of this work was done while Yuval Rabani was on sabbatical leave at Cornell University, while visiting IBM Almaden Research Center, and while visiting the Institute for Pure and Applied Mathematics at UCLA; his research at the Technion was supported in part by ISF grant number 52/03 and BSF grant number 02-00282. This work was done while Ravi Kumar and D. Sivakumar were at the IBM Almaden Research Center. A preliminary version of this paper appeared in Proceedings of 20th Annual IEEE Conference on Computational Complexity (CCC 2005).

Keywords

Fourier analysis
Multicut
Sparsest-cut
Unique games conjecture

Access to Document

10.1007/s00037-006-0210-9

Cite this

@article{868a7119bae0497fa98819167b99f3c5,

title = "On the hardness of approximating multicut and sparsest-cut",

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 Ω(√log log n).",

keywords = "Fourier analysis, Multicut, Sparsest-cut, Unique games conjecture",

author = "Shuchi Chawla and Robert Krauthgamer and Ravi Kumar and Yuval Rabani and D. Sivakumar",

note = "Funding Information: We thank the anonymous referees for useful comments, and in particular for suggesting a simplification of our original proof of Lemma 3.1. Part of this work was done while Shuchi Chawla was visiting IBM Almaden Research Center. Part of this work was done while Yuval Rabani was on sabbatical leave at Cornell University, while visiting IBM Almaden Research Center, and while visiting the Institute for Pure and Applied Mathematics at UCLA; his research at the Technion was supported in part by ISF grant number 52/03 and BSF grant number 02-00282. This work was done while Ravi Kumar and D. Sivakumar were at the IBM Almaden Research Center. A preliminary version of this paper appeared in Proceedings of 20th Annual IEEE Conference on Computational Complexity (CCC 2005).",

year = "2006",

month = jun,

doi = "10.1007/s00037-006-0210-9",

language = "אנגלית",

volume = "15",

pages = "94--114",

journal = "Computational Complexity",

issn = "1016-3328",

publisher = "Birkhauser Verlag Basel",

number = "2",

}

TY - JOUR

T1 - On the hardness of approximating multicut and sparsest-cut

AU - Chawla, Shuchi

AU - Krauthgamer, Robert

AU - Kumar, Ravi

AU - Rabani, Yuval

AU - Sivakumar, D.

N1 - Funding Information: We thank the anonymous referees for useful comments, and in particular for suggesting a simplification of our original proof of Lemma 3.1. Part of this work was done while Shuchi Chawla was visiting IBM Almaden Research Center. Part of this work was done while Yuval Rabani was on sabbatical leave at Cornell University, while visiting IBM Almaden Research Center, and while visiting the Institute for Pure and Applied Mathematics at UCLA; his research at the Technion was supported in part by ISF grant number 52/03 and BSF grant number 02-00282. This work was done while Ravi Kumar and D. Sivakumar were at the IBM Almaden Research Center. A preliminary version of this paper appeared in Proceedings of 20th Annual IEEE Conference on Computational Complexity (CCC 2005).

PY - 2006/6

Y1 - 2006/6

N2 - 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 Ω(√log log n).

AB - 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 Ω(√log log n).

KW - Fourier analysis

KW - Multicut

KW - Sparsest-cut

KW - Unique games conjecture

UR - http://www.scopus.com/inward/record.url?scp=33745302806&partnerID=8YFLogxK

U2 - 10.1007/s00037-006-0210-9

DO - 10.1007/s00037-006-0210-9

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:33745302806

SN - 1016-3328

VL - 15

SP - 94

EP - 114

JO - Computational Complexity

JF - Computational Complexity

IS - 2

ER -

On the hardness of approximating multicut and sparsest-cut

Abstract

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this