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 - https://www.scopus.com/pages/publications/27644478310
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 -