On the hardness of approximating multicut and sparsest-cut

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

doi:10.1109/CCC.2005.20

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 proceeding › Conference contribution › peer-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 language	English
Title of host publication	Proceedings of the 20th Annual IEEE Conference on Computational Complexity
Pages	144-153
Number of pages	10
DOIs	https://doi.org/10.1109/CCC.2005.20
State	Published - 2005
Externally published	Yes
Event	20th Annual IEEE Conference on Computational Complexity - San Jose, CA, United States Duration: 11 Jun 2005 → 15 Jun 2005

Publication series

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

Conference

Conference	20th Annual IEEE Conference on Computational Complexity
Country/Territory	United States
City	San Jose, CA
Period	11/06/05 → 15/06/05

Access to Document

10.1109/CCC.2005.20

Cite this

@inproceedings{388a15b7b9b04b8dbed6daa1f6bd092c,

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 [STOC, 2002]. A quantitatively stronger version of the conjecture implies inapproximability factor of Ω(log log n).",

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

year = "2005",

doi = "10.1109/CCC.2005.20",

language = "אנגלית",

isbn = "0769523641",

series = "Proceedings of the Annual IEEE Conference on Computational Complexity",

pages = "144--153",

booktitle = "Proceedings of the 20th Annual IEEE Conference on Computational Complexity",

note = "20th Annual IEEE Conference on Computational Complexity ; Conference date: 11-06-2005 Through 15-06-2005",

}

Chawla, S, Krauthgamer, R, Kumar, R, Rabani, Y & Sivakumar, D 2005, On the hardness of approximating multicut and sparsest-cut. in Proceedings of the 20th Annual IEEE Conference on Computational Complexity. Proceedings of the Annual IEEE Conference on Computational Complexity, pp. 144-153, 20th Annual IEEE Conference on Computational Complexity, San Jose, CA, United States, 11/06/05. https://doi.org/10.1109/CCC.2005.20

On the hardness of approximating multicut and sparsest-cut. / Chawla, Shuchi; Krauthgamer, Robert; Kumar, Ravi et al.
Proceedings of the 20th Annual IEEE Conference on Computational Complexity. 2005. p. 144-153 (Proceedings of the Annual IEEE Conference on Computational Complexity).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

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.

PY - 2005

Y1 - 2005

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 [STOC, 2002]. A quantitatively stronger version of the conjecture implies 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 [STOC, 2002]. A quantitatively stronger version of the conjecture implies inapproximability factor of Ω(log log n).

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

U2 - 10.1109/CCC.2005.20

DO - 10.1109/CCC.2005.20

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:27644478310

SN - 0769523641

T3 - Proceedings of the Annual IEEE Conference on Computational Complexity

SP - 144

EP - 153

BT - Proceedings of the 20th Annual IEEE Conference on Computational Complexity

T2 - 20th Annual IEEE Conference on Computational Complexity

Y2 - 11 June 2005 through 15 June 2005

ER -

On the hardness of approximating multicut and sparsest-cut

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this