600.484: Approximation Algorithms

Fall Term 2001

Christian Scheideler

Course Structure

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.



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.

Christian Scheideler
Last modified: Thu Aug 30 2001