Approximating the s-t Path TSP and Maximizing Submodular Functions
University of Pittsburgh
Green Computing Algorithmics
École polytechnique fédérale de Lausanne (EPFL)
Approximation Algorithms for the Traveling Salesman Problem
ADFOCS is organized Andreas Wiese, Antonios Antoniadis and Cosmina Croitoru as part of the activities of the Algorithms and Complexity Group and the International Max Planck Research School of the Max Planck Institute for Informatics.
The purpose of the ADFOCS summer school is to introduce young researchers to topics which are in the focus of current research in the field of theoretical computer science. In order to achieve this, ADFOCS brings together leading researchers from this field with international participants of graduate level and above.
Please do not hesitate to contact us for any questions via email to email@example.com.