600.484: Approximation Algorithms

Fall Term 2001

Christian Scheideler

Course Structure

Lectures:

Mon 1.00 - 1.45 p.m.     NEB 12      Scheideler

Tue 1.00 - 1.45 p.m.     NEB 12      Scheideler

Exercises:

Wed 1.00 - 1.45 p.m.     NEB 12      Scheideler

Topics

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.

Grading

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

Syllabus

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

The lecture is based on lecture notes (in German) developed by Rolf Wanka at the University of Paderborn, Germany.

Assignments

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.

Literature

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.

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