Lecture notes from several years ago when Prof. Goemans previously taught this course are available below. These do not match exactly with the current term, although there is some overlap. Still, this will be a good starting point and a useful resource.
Linear Programming (PDF)
Network Flows (PDF)
Approximation Algorithms (PDF)
The lecture notes below were provided by students who took the class in an earlier term:
-
A Simple Mincut Algorithm (PDF) (Courtesy of Roberto De Prisco (Associate Professor at the University of Salerno, ITALY). Used with permission.)
-
Euclidean TSP Approximation Scheme (PDF) (Courtesy of Salil Vadhan (Thomas D. Cabot Associate Professor of Computer Science). Used with permission.)
-
Lattices (PDF) (Courtesy of David Wilson. Used with permission.)