T.S. Jayram, Subhash Khot, et al.
Journal of Computer and System Sciences
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.
T.S. Jayram, Subhash Khot, et al.
Journal of Computer and System Sciences
Ronald Fagin, Ravi Kumar, et al.
SODA 1998
Ziv Bar-Yossef, T.S. Jayram, et al.
FOCS 2004
Guy Kortsarz, Robert Krauthgamer, et al.
SIAM Journal on Computing