DIMACS and The Center for Computational Intractability Joint Workshop on Approximation Algorithms: The Last Decade and the Next

June 13 - 17, 2011
Princeton University

Sanjeev Arora, Princeton University
Moses Charikar, Princeton University
Sanjeev Khanna, U. Penn
Mohammad Taghi Hajiaghayi, U. Maryland and AT&T Labs
Vijay Vazirani, Georgia Tech
Lisa Zhang, Bell Labs
Contact information for organizers: approx.workshop at gmail.com.

Presented under the auspices of the Special Focus on Hardness of Approximation.

Workshop announcement

The study of approximation algorithms for NP-hard problems has blossomed into a rich field, especially as a result of intense work over the last two decades. Furthermore, approximation has become a guiding principle for much of algorithm design in areas such as algorithmic game theory and economics, online computation, streaming algorithms, metric embeddings, and learning theory. The Princeton Center for Computational Intractability and DIMACS are hosting a 5- day workshop to bring together researchers to focus on the important milestones achieved in this field over the last decade. We also hope to set the tone for future work by identifying potentially fruitful areas, issues and questions. The discussion will be shaped by 10 hour-long survey talks, 20+ research talks, and informal discussion sessions.

Next: Call for Participation
Workshop Index
DIMACS Homepage
Contacting the Center
Document last modified on July 22, 2010.