Block seminar to be held on July 4-5.
There will be preparation meetings on May 2, May 10 and May 30, at 12:15 (in a room of MA building that will be announced later).
Description:
In this seminar, we will study papers that have recently appeared in one of the major conferences on algorithms & discrete optimization, including SODA (Symposium on Discrete Algorithms) and ESA (European Symposium on Algorithms).By nature, this seminar addresses a wide range of topics, such as graph algorithms, algorithmic game theory, packing and covering problems, clustering, scheduling, ... The goal is to make students familiar with developments in this area, and to teach them the necessary tools to explore scientific papers and literature on their own. Moreover, students will acquire important skills for presenting these technical results to a wider audience.
Prerequisites:
The purpose of this seminar is to read and understand recent results from the literature on graphs, algorithms and optimization. Participants are expected to have some experience with the analysis of advanced algorithms (e.g. from an ADM course).