New Directions in Approximations Algorithms (2015)

Date & Time

February 22-28, 2015

Sanjeev Arora, Princeton University
Uriel Feige, Weizmann Institute
Michel Goemans, Massachusetts Institute of Technology
David Shmoys, Cornell University

This is the second Simons Symposium on Approximation Algorithms for NP-hard problems. The first, in January 2013, focused on core techniques and problems of this field. The upcoming meeting is expected to also highlight how the notion of approximation has found uses in other areas, including mechanism design, combinatorial optimization, online algorithms, machine learning, big-data algorithms, differential privacy and discrepancy theory.

The schedule will be a mix of surveys and talks about new results. The structure will be informal and provide time for intense group discussions about open problems. Not all attendees will be expected to give long talks.

« Back to Simons Symposia

Subscribe to MPS announcements and other foundation updates