600.484: Approximation Algorithms
Fall Term 2001
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
Topics covered will be approximation with absolute and relative guarantees,
polynomial time approximation schemes, complexity theoretic considerations,
techniques for randomized approximation algorithms, and approximate counting.
[Analysis] Prereq: 600.363/463 or Perm. req'd.
- 1/3: assignments
- 1/3: mid-term exam
- 1/3: final exam
The lecture is based on lecture notes (in German) developed by
Rolf Wanka at the
University of Paderborn, Germany.
At most two people (in exceptions also three) are allowed to work together
on an assignment. Please indicate on your submission with whom you collaborated
to solve the assignment.
It is not necessary to have these books! The lecture will be self-contained and
all lecture notes can be downloaded from this web page.
- 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.
Last modified: Thu Aug 30 2001