|
|
|
|
Metric Techniques in Approximation Algorithms Anupam Gupta Carnegie Mellon University |
|
Applications of Cost-Sharing Methods to Hard Optimization
Problems Stefano Leonardi Sapienza University of Rome |
|
Primal-dual Algorithms for Online Optimization Seffi Naor Technion |
ADFOCS is organized as part of the activities of the
Algorithms and Complexity Group
and the International Max-Planck Research School
of the Max-Planck-Institut für Informatik.
The scope of ADFOCS is international. Young researchers at the PhD student
or postdoc level are cordially invited to participate. The goal of ADFOCS
is to have hot topics from fundamental areas of computer science
presented by top researchers in the field, bringing participants to
the frontiers of current research. We will provide some grants for graduate students and young
researchers. For more information on this year's lecturers, lectures, and
schedule please have a look at the
For information on the previous ADFOCS summer schools see ADFOCS 00, ADFOCS 01, ADFOCS 02, ADFOCS 03, ADFOCS 04, ADFOCS 05 and ADFOCS 06. ADFOCS 07.