Ravi Kumar, Prabhakar Raghavan, et al.
ACM TOIT
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
Ronald Fagin, Ravi Kumar, et al.
SIAM Journal on Discrete Mathematics
Eran Halperin, Guy Kortsarz, et al.
SIAM Journal on Computing
Conference paper
Algorithms for ℓp low-rank approximation
Flavio Chierichetti, Sreenivas Gollapudi, et al.
ICML 2017