Ziv Bar-Yossef, Ravi Kumar, et al.
SODA 2002
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.
Ziv Bar-Yossef, Ravi Kumar, et al.
SODA 2002
Andrei Broder, Ravi Kumar, et al.
Computer Networks
Robert Krauthgamer, Jmes R. Lee
FOCS 2006
Ravi Kumar, Prabhakar Raghavan, et al.
ACM TOIT