Ravi Kumar, Jasmine Novak, et al.
Communications of the ACM
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
Self-similarity in the web
Stephen Dill, Ravi Kumar, et al.
VLDB 2001
Ziv Bar-Yossef, Ravi Kumar, et al.
SODA 2002
Ravi Kumar, Prabhakar Raghavan, et al.
ACM TOIT