CS 466/666, Fall 2005

Resources

Home People Policies Resources Schedule Assignments Project

You may wish to have a general book on algorithms on hand for review of CS 341 material. Due to its coverage of a number of other topics in the course, one recommended possibility is listed below. Either the old or the new edition should be adequate for our purposes.

[CLR] Introduction to Algorithms, by Cormen, Leiserson, Rivest, MIT Press, 1990, or second edition, by Cormen, Leiserson, Rivest, and Stein, 2001.

The following additional resources are either available through the links below or on reserve in the library; the course outline lists topics and page numbers.

[A] Albers, "Online algorithms: a survey", Mathematical Programming 97:3-26, 2003, http://www.informatik.uni-freiburg.de/~salbers/ismp03.ps.gz
[BB] Brassard and Bratley, Fundamentals of Algorithmics, Prentice-Hall, 1996.
[BG] Baase and Van Gelder, Computer Algorithms: Introduction to Design and Analysis, Addison-Wesley, 2000.
[DF99] Downey and Fellows, Parameterized Complexity, Springer, 1999.
[DF98] Downey and Fellows, "Parameterized Complexity After (Almost) 10 Years: Review and Open Questions", available for downloading from Rod Downey's publications page.
[H] Hochbaum, Approximation Algorithms for NP-hard Problems, PWS Publishing, 1995.
[K] Karp, "An introduction to randomized algorithms", Discrete Applied Mathematics 34: 165-201, 1991. on reserve as UWD 1107.
[KT] J. Kleinberg and E. Tardos. Introduction to Analysis of Algorithms. Addison-Wesley, 2005.
[Mars] Bulletin of the European Assocation for Theoretical Computer Science, The Computational Complexity Column, Number 69, October 99 http://people.cs.uchicago.edu/~fortnow/beatcs/.
[MR] Motwani and Raghavan, Randomized Algorithms, Cambridge University Press, 1995.
[N] Rolf Niedermeier, Invitation to fixed-parameter algorithms, Habilitation Thesis available on his publications page.
Solutions on reserve as UWD 1159.
Newsgroup uw.cs.cs466 for announcements and questions.
Notes on randomized algorithms [ps/pdf]

The following websites might prove useful for projects or further reading.

A compendium of optimization problems
The parameterized complexity home page, including a compendium of parameterized problems.