Slide 1Approximating NP-hard Problems Efficient Algorithms and their Limits Prasad Raghavendra University of Washington Seattle Slide 2 Max 3 SAT Find an assignment that…
Slide 1Prasad Raghavendra University of Washington Seattle Optimal Algorithms and Inapproximability Results for Every CSP? Slide 2 Constraint Satisfaction Problem A Classic…
Slide 11/19 Minimizing weighted completion time with precedence constraints Nikhil Bansal (IBM) Subhash Khot (NYU) Slide 2 2/19 The Problem Given n jobs, arbitrary weights…
Slide 1 Subhash Khot’s work and its impact Sanjeev Arora Computer Science Dept, Princeton University ICM 2014 Nevanlinna Prize Laudatio Slide 2 Main points from Nevanlinna…
Constraint Satisfaction, Semidefinite Programming and the Unique Games Conjecture Prasad Raghavendra University of Washington Seattle Optimal Algorithms and Inapproximability…
Constraint Satisfaction, Semidefinite Programming and the Unique Games Conjecture Prasad Raghavendra University of Washington Seattle Optimal Algorithms and Inapproximability…