Computer Science 611 Advanced Topics in Design and Analysis of Algorithms Spring 2001

General Information

Prerequisites: CS 511 or consent of the instructor.

Time and place: MW 4:00--5:30, 611 Gilman.

Instructor: David Fernández-Baca, 209 Atanasoff; Tel. 294-2168; Email: fernande@cs.iastate.edu

Touchtone registration number: 8204 005

Grading: Based on (1) homework, (2) project (with written and oral component), and (3) class participation.

Topics: Approximation algorithms; online algorithms; randomization; applications to optimization, computational finance, web searching and other areas.

Homework

• Homework 1, in ps and pdf

References

Texts

• G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-Spaccamela, M. Protasi, Complexity and Approximation: Combinatorial Optimization Problems and their Approximability Properties, Springer-Verlag, 1999.
• A. Borodin and R. El-Yaniv, Online Computation and Competitive Analysis, Cambridge University Press, 1998.
• D.S. Hochbaum (ed.), Approximation Algorithms for NP-Hard Problems, PWS Publishing, 1996.
• R. Motwani and P. Raghavan, Randomized Algorithms, Cambridge University Press, 1995.

Web Resources

• NEW (2/8/01): A compendium of NP optimization problems.
• David Williamson's lecture notes on approximation algorithms. (Recommended)
• Lecture notes by Michel Goemans: Approximation algs, Online algs.
• Avrim Blum's course on approximation and online algorithms at CMU.
• Survey paper on Approximation Algorithms by David Shmoys
• Cheriyan-Ravi lecture notes.
• Robert Vanderbei's lecture notes on linear programming. (Useful background material)