David Liben-Nowell, Jasmine Novak, et al.
PNAS
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.
David Liben-Nowell, Jasmine Novak, et al.
PNAS
Ronald Fagin, Ravi Kumar, et al.
SIAM Journal on Discrete Mathematics
Ronald Fagin, Ravi Kumar, et al.
SIAM Journal on Discrete Mathematics
Ziv Bar-Yossef, T.S. Jayram, et al.
FOCS 2004