In this course, we study algorithms for NP-hard optimization problems that compute solutions with a provable performance guarantee. The course counts as "Algorithmic Discrete Mathematics III" (ADM ...
In this course, we study algorithms for NP-hard optimization problems that compute solutions with a provable performance guarantee. The course counts as "Algorithmic Discrete Mathematics III" (ADM III). It heavily relies on Linear Programming (ADM I) and to a lesser degree on ADM II (Integer Programming).
Lectures:
- Wednesday, 16:15-17:45 in room MA 841
- Thursday, 10:15-11:45 in room MA 549
