Approximation algorithms and the hardness of approximation

Arriving Sunday, November 27 and departing Friday December 2, 2011

Confirmed Participants

Name Affiliation
Andrews, Matthew Bell Laboratories Alcatel-Lucent USA
Austrin, Per KTH Royal Institute of Technology
Bansal, Nikhil Eindhoven University of Technology
Behsaz, Babak University of Alberta
Borradaile, Glencora Oregon State University
Byrka, Jaroslaw University of Wroclaw
Cheriyan, Joseph University of Waterloo
Cheung, Kevin Carleton University
Chuzhoy, Julia Toyota Technical Institute at Chicago
Feige, Uriel Weizmann Institute
Fleischer, Lisa Dartmouth College
Friggstad, Zachary University of Alberta
Fung, Wai Shing (Issac) University of Waterloo
Georgiou, Konstantinos University of Waterloo
Gupta, Anupam Carnegie Mellon University
Harsha, Prahladh Tata Institute of Fundamental Research, Mumbai
Harvey, Nicholas University of British Columbia
Khandekar, Rohit IBM Research
Khanna, Sanjeev University of Pennsylvania
Khuller, Samir University of Maryland
Konemann, Jochen University of Waterloo
Lee, James University of Washington
Makarychev, Yury Toyota Technological Institute at Chicago
Makarychev, Konstantin IBM Watson Research Center USA
Moshkovitz, Dana Massachusetts Institute of Technology
Naves, Guyslain McGill University
Newman, Alantha CNRS and Université Grenoble-Alpes
Rothvoss, Thomas University of Washington
Saberi, Amin Stanford University
Salavatipour, Mohammad University of Alberta
Shepherd, Bruce McGill University
Shmoys, David B. Cornell University
Singh, Mohit Computer Science McGill University
Steurer, David Cornell University
Svensson, Ola Ecole Polytechnique Federale de Lausanne
Swamy, Chaitanya University of Waterloo
Talwar, Kunal Microsoft Research SVC
van Zuylen, Anke Max Planck Institute for Informatics
Vetta, Adrian McGill Unviversity
Vishnoi, Nisheeth École Polytechnique Fédérale de Lausanne
Williamson, David Cornell University
Wu, Yi IBM Almaden Research Center USA