Sciweavers

COCO
2005
Springer

On the Hardness of Approximating Multicut and Sparsest-Cut

14 years 5 months ago
On the Hardness of Approximating Multicut and Sparsest-Cut
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 [STOC, 2002]. A quantitatively stronger version of the conjecture implies an inapproximability factor of Ω( √ log log n).
Shuchi Chawla, Robert Krauthgamer, Ravi Kumar, Yuv
Added 26 Jun 2010
Updated 26 Jun 2010
Type Conference
Year 2005
Where COCO
Authors Shuchi Chawla, Robert Krauthgamer, Ravi Kumar, Yuval Rabani, D. Sivakumar
Comments (0)