Approximation Algorithms and the Hardness of Approximation

Arriving Sunday, August 3 and departing Friday August 8, 2014

Confirmed Participants

Name Affiliation
Ahmadian, Sara University of Waterloo
An, Hyung-Chan École polytechnique fédérale de Lausanne
Austrin, Per KTH Royal Institute of Technology
Beame, Paul University of Washington
Chan, Siu On Microsoft Research New England
Charikar, Moses Princeton University
Chekuri, Chandra University of Illinois, Urbana-Champaign
Cheriyan, Joseph University of Waterloo
Dinur, Irit Weizmann Institute
Ene, Alina Princeton University
Friggstad, Zachary University of Alberta
Gupta, Anupam Carnegie Mellon University
Hastad, Johan Royal Institute of Technology, Stockholm
Huang, Sangxia KTH Royal Institute of Technology
Khanna, Sanjeev University of Pennsylvania
Lee, James University of Washington
Linhares, Andre University of Waterloo
Makarychev, Konstantin Northwestern University
Makarychev, Yury Toyota Technological Institute at Chicago
Oveis Gharan, Shayan University of Washington
Pitassi, Toniann University of Toronto
Poloczek, Matthias Cornell University
Raghavendra, Prasad University of California, Berkeley
Rao, Satish Computer Science Division -- University of California -- Berkeley
Ravi, R. Carnegie Mellon University
Rothvoss, Thomas University of Washington
Salavatipour, Mohammad University of Alberta
Shepherd, Bruce McGill University
Shmoys, David Cornell University
Sidiropoulos, Anastasios The Ohio State University
Singh, Mohit Microsoft Research, Redmond
Sivakumar, Rohit University of Alberta
Steurer, David Cornell University
Svensson, Ola Ecole Polytechnique Federale de Lausanne, Switzerland
Swamy, Chaitanya University of Waterloo
van Zuylen, Anke College of William and Mary
Vishnoi, Nisheeth École Polytechnique Fédérale de Lausanne
Vondrak, Jan IBM Almaden Research Center
Vygen, Jens University of Bonn
Wiese, Andreas Max-Planck-Institut fur Informatik
Williamson, David Cornell University
Wright, John Carnegie Mellon University