This course explores the two related topics of Approximation Algorithms and Online Algorithms. Both of these involve the goal of finding provably good approximate solutions to problems that are hard to solve exactly. In the case of approximation algorithms, the difficulty is overcoming computational intractibility; in the case of online algorithms, the difficulty is a lack of full information about the input.
| Dr. Ulrich Meyer
|
Building 46 (MPII), Room 325 |
| Lectures : |
|
Wednesdays, 14-16 h, Room 001, Building 45 |
| First lecture: |
20th April 2005 |
|
| Tutorials: |
Mo 16-18, Room 021 (MPII)
|
|
| References: |
here.
|
|
| Subscription: |
here.
|
|
| Mailinglist: |
here.
|
1. Sheet Due: 5th May 2005.
2. Sheet Due: 12th May 2005.
3. Sheet Due: 27th May 2005.
4. Sheet Due: 9th June 2005.
5. Sheet Due: 30th June 2005.
There will be oral exams on Wed, 20th of July and Fr, 22nd of July. Room 309A at MPI (Building 46).