Lecture Notes: The lecture notes have last been updated on the 30th of October and now cover lectures 1-4.
Oral Exams: The exams are oral exams. The dates will be announced later. The first exam date will lie somewhere between the 4th and 8th of February, 2019.
Room: We are in room 2.078 from now on!
Note: If you attend the lecture and have not done so yet, please send me a short email to this email address. Thank you!
The content of this lecture is the theoretical analysis of approximation algorithms for cluster analysis, in particular covering the following areas:
|Tuesday, 10:15-11:45||INF / Room 2.078||October 09th||Schmidt|
|October 09|| 1 Introduction
2 The happy world of k-center
2.2 A simple and elegant 2-approximation
|October 16|| 2.3 A matching lower bound
2.4 Incremental and hierarchical clustering
|October 23|| 2.4 continued: Proof
2.5 Another elegant 2-approximation
|October 30||2.6 A streaming algorithm for k-center|
|November 6||–cancelled due to illness–|
|November 13|| 2.7 The k-center problem with outliers
2.8 Fair k-center
The Lecture notes cover the content of the lecture and are updated after each lecture.