Ziv Bar-Yossef, T.S. Jayram, et al.
Proceedings of the Annual IEEE Conference on Computational Complexity
Paper
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). © Birkhäuser Verlag, Basel 2006.
Related
Conference paper
Approximating edit distance efficiently
Ziv Bar-Yossef, T.S. Jayram, et al.
FOCS 2004
Tuǧkan Batu, Sanjoy Dasgupta, et al.
Proceedings of the Annual IEEE Conference on Computational Complexity
Conference paper
Greedy list intersection
Robert Krauthgamer, Aranyak Mehta, et al.
ICDE 2008