CS 263, Spring 2014: Analysis of Algorithms

This course meets Monday, Wednesday, and Fridays, 3:00 - 3:50 in Bren 1429. Coursework will consist of weekly homeworks, graded during the class period on which they are due, and a final exam. Group work on homeworks is permitted and encouraged. Knowledge of a previous course in the design and analysis of algorithms (such as the CS 161 or CS 260 courses taught at UCI) is expected, but otherwise all CS graduate students are welcome.

The textbook for this course will be Approximation Algorithms, by Vijay Vazirani. The tentative schedule of topics is to go through the chapters of this book at a rate of approximately one chapter per lecture.

Tentative schedule:


David Eppstein, ICS, UC Irvine.