This lecture takes place twice a week (on average 3 h of lecture and 1 h tutorial) in the following slots:
|Tuesday||12:00 - 13:30||V 38.01||16., 23., 30.||6., 13., 20., 27.||4., 11., 18.||8., 15., 22., 29.||5.|
|Thursday||9:45 - 11:15||V 38.04||18., 25.||1., 8., 15., 22., 29.||6., 13., 20.*||10., 17., 24., 31.*||7.|
There will be a written exam at the end of the semester (unless your Prüfungsordnung does not allow that; in that case, there will be an oral exam). Prerequisite for participation in the exam is a ‘Schein’, i.e. you need to pass two MC-tests.
The final dates of the tutorials are announced during lecture at least one week before the tutorial takes place. For each tutorial there will be an exercise sheet. Please take a look at the sheet before the tutorial and solve the exercises on your own.
A fake MC-test of the year 2014 can be found here.
A very good book on approximation algorithms by Shmoys and Williamson can be found online.
Lecture Notes (currently work in progress. Please report any mistakes if you find some).
should be easy to find via google, e.g.
Students at the master (INF, SWT, INFOTECH, Winfo, …) or advanced Bachelor level.