DIMACS Tutorial on Limits of Approximation Algorithms: PCPs and Unique Games

July 20 - 21, 2009
DIMACS Center, CoRE Building, Rutgers University

Prahladh Harsha, University of Texas, Austin
Moses Charikar, Princeton University
This tutorial is jointly sponsored by the DIMACS Special Focus on Hardness of Approximation, the DIMACS Special Focus on Algorithmic Foundations of the Internet, and the Center for Computational Intractability with support from the National Security Agency and the National Science Foundation.

Call for Participation:

This tutorial is geared toward graduate students, postdocs, and others who but who may not be intimately familiar with this topic but would like a focused introduction. The goal is to provide both context and specifics, with more background than is given at a typical workshop of researchers in the field. The tutorial will not assume prior knowledge of results on hardness of approximation, but it will assume a beginning graduate level understanding of theoretical computer science and complexity.

There is no registration fee to attend this tutorial, but we do ask that you register to attend.

Limited travel support is available for non-local participants. If you would like to apply for travel support, please send your CV, an estimate of travel costs, and a short (one paragraph) statement of why you would like to attend the tutorial by email to tcar@dimacs.rutgers.edu with the subject "Limits Tutorial". Applications should be submitted by July 3, 2009 to receive full consideration, but we will continue to review requests after that date. Preference will be given to students and postdocs, so if you are in one of these categories, please let us know.

Previous: Announcement
Next: Program
Workshop Index
DIMACS Homepage
Contacting the Center
Document last modified on July 2, 2009.