Mon 1.00 - 1.45 p.m. NEB 12 Scheideler

Tue 1.00 - 1.45 p.m. NEB 12 Scheideler

Wed 1.00 - 1.45 p.m. NEB 12 Scheideler

- 1/3: assignments
- 1/3: mid-term exam
- 1/3: final exam

- Sep 10-12: Introduction
- Sep 17-19: Approximation with absolute guarantees I (link contains I and II)
- Sep 24-26: Approximation with absolute guarantees II
- Oct 1-3: Approximation with relative guarantees I (link contains I and II)
- Oct 8-10: Approximation with relative guarantees II
- Oct 15-17: Approximation schemes

no lectures in this week; read lecture notes instead - Oct 22: Complexity theoretic considerations
- Oct 23: Open discussion
- Oct 24: Midterm exam
- Oct 29-31: Introduction to probability theory
- Nov 5-7: Randomized approximation algorithms I (link contains I, II and Derandomization)
- Nov 12-14: Randomized approximation algorithms II
- Nov 19-21: Derandomization
- Nov 26-28: Approximate counting I (link contains I and II)
- Dec 3-5: Approximate counting II
- Dec 10: Open discussion
- Dec 17, 2-4 pm: Final exam

- Assignment 1 (due Sep 19)
- Assignment 2 (due Sep 26)
- Assignment 3 (due Oct 3) with a solution to Problem 10
- Assignment 4 (due Oct 10)
- Assignment 5 (due Oct 23)
- Assignment 6 (due Nov 7)
- Assignment 7 (due Nov 14)
- Assignment 8 (due Nov 21)
- Assignment 9 (due Nov 28)
- Assignment 10 (due Dec 5)

- G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-Spaccamela, and M. Protasi. Complexity and Approximation. Springer Verlag, 1999.
- Michael R. Garey and David S. Johnson. Computers and Intractability. W. H. Freeman and Company. 1979.
- Dorit S. Hochbaum (ed.). Approximation Algorithms for NP-hard problems. PWS Publishing Company, 1995.
- Rajeev Motwani and Prabhakar Raghavan. Randomized Algorithms. Cambridge University Press. 1995.
- Vijay V. Vazirani. Approximation Algorithms. Springer Verlag, 2001.

Christian Scheideler Last modified: Thu Aug 30 2001