Approximation Algorithms and the Hardness of Approximation

Arriving Sunday, November 12 and departing Friday November 17, 2017

Confirmed Participants

Name Affiliation
An, Hyung-Chan Yonsei University
Blumenstock, Markus Johannes Gutenberg University Mainz
Chalermsook, Parinya Aalto University
Chawla, Shuchi University of Wisconsin-Madison
Cheriyan, Joseph University of Waterloo
Dinitz, Michael Johns Hopkins University
Ene, Alina Boston University
Feige, Uriel Weizmann Institute
Friggstad, Zachary University of Alberta
Goemans, Michel Massachusetts Institute of Technology
Grandoni, Fabrizio IDSIA, University of Lugano
Gupta, Anupam Carnegie Mellon University
Gutekunst, Sam Cornell University
Hopkins, Samuel Cornell University
Khodamoradi, Kamyar University of Alberta
Koh, Cedric University of Waterloo
Konemann, Jochen University of Waterloo
Laekhanukit, Bundit Simons Institute for the Theory of Computing & Shanghai University of Finance and Economics
Lau, Lap Chi University of Waterloo
Lee, James University of Washington
Lee, Euiwoong Simons Institute
Mahboub, Maryam U. of Alberta
Makarychev, Konstantin Northwestern University
Makarychev, Yury Toyota Technological Institute at Chicago
Megow, Nicole University of Bremen
Nagarajan, Viswanath University of Michigan
Naor, Seffi Technion
Nimavat, Rachit Toyota Technological Institute at Chicago
Oveis Gharan, Shayan University of Washington
Paul, Alice Brown University
Rahgoshay, Mirmahdi University of Alberta
Saberi, Amin Stanford University
Salavatipour, Mohammad R. University of Alberta
Sanita, Laura University of Waterloo
Schramm, Tselil Harvard/MIT
Shmoys, David B. Cornell University
Swamy, Chaitanya University of Waterloo
Trevisan, Luca U.C. Berkeley
Tulsiani, Madhur Toyota Technological Institute at Chicago
Vijayaraghavan, Aravindan Northwestern University
Wiese, Andreas U. of Chile
Zenklusen, Rico ETH Zurich