Funda Ergün, Ravi Kumar, et al.
Information and Computation
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
Eran Halperin, Guy Kortsarz, et al.
SIAM Journal on Computing
Uriel Feige, Robert Krauthgamer
SIAM Review
Conference paper
On sketching quadratic forms
Alexandr Andoni, Jiecao Chen, et al.
ITCS 2016