Notes and Surveys (Unpublished) by Joseph Cheriyan

Lecture Notes: Approximation Algorithms for Network Problems (homepage)

Co-authored with Ram Ravi GSIA, Carnegie Mellon University, Pittsburgh, PA.

postscript file 214pages, 850KB

Table of Contents ( text or postscript).

Grad course on Probabilistic Methods in Discrete Math (CO 739) Winter 2002 (11:30-12:20 MWF)

( Detailed outline)

Grad course on Approximation Algorithms, Fields Institute, Toronto, Fall 1999 (Sep.15-Dec.1)

C&O 453 Network Design (gzipped postscript, 154pages). Please send email for this.