Planned Syllabus

Course Outline:

I. Introduction, Expected Dijkstra

II. Graph Algorithms

III. Advanced NP-Completeness/Complexity

IV. Approximation Algorithms and Search

V. Randomized Algorithms

Other Advanced Topics may be covered depending on class interest.

The text will mostly be used for Approximation Algorithms (and some NP-hardness stuff), other topics will be covered by papers, the 222A text and other materials.