Approximating NP-hard Problems Efficient Algorithms and their Limits Prasad Raghavendra University of Washington Seattle.
Prasad Raghavendra University of Washington Seattle Optimal Algorithms and Inapproximability Results for Every CSP?
1/19 Minimizing weighted completion time with precedence constraints Nikhil Bansal (IBM) Subhash Khot (NYU)
Subhash Khot’s work and its impact Sanjeev Arora Computer Science Dept, Princeton University ICM 2014 Nevanlinna Prize Laudatio.
Optimal Algorithms and Inapproximability Results for Every CSP?
