Graduate Seminar on Discrete Optimization

Graduate Seminar on Discrete Optimization (S4C1)

The talks in this seminar will be based on recently published papers on different versions of facility location problems.

Class hours: Mondays 14:15-15:45. Approval talks: 12:15-13:45

Number	Approval talk	Talk	Name	Topic	Mentoring
1	16.4. (14:15-15:45)	30.4.	Jan Niklas Ehm	Local Search	Pietro Saccardi
2	23.4.	7.5.	Claudia Renner	Dual Fitting	Pietro Saccardi
3	30.4.	14.5.	Lukas Erlenbach	Combined algorithms for uncapacitated facility location	Markus Ahrens
4	7.5.	28.5.	Federico Miceli	Approximation for k-median	Markus Ahrens
5	14.5.	4.6.	Simon Thomä	Primal-dual algorithms	Anna Hermann
6	28.5.	11.6.	Thorben Tröbst	Ordered k-median	Anna Hermann
7	4.6.	18.6.	Joachim Wilhelm	Capacitated k-center problem	Tilmann Bihler
8	11.6.	25.6.	Tim Racs	LP-based algorithm for capacitated facility location	Rudi Scheifele
9	18.6.	9.7.	Raoul Nicolodi	Capacitated k-median with (1 + ε)k open facilities.	Rudi Scheifele
10	25.6.	16.7.	Jan Henrik Klüver	Clustering with outliers	Niko Klewinghaus

A regular participation in the talks and an active collaboration are mandatory for passing the seminar.
The talks will take approximately 75 minutes. The remaining 15 minutes are intended for a discussion.
Each participant has to write a summary consisting of one or two pages.
Each participant has to give an approval talk (typically three weeks before the regular talk). Passing the approval talk is a prerequisite for giving the regular seminar talk.