Report Number: CS-TR-92-1435
Institution: Stanford University, Department of Computer Science
Title: Lecture notes on approximation algorithms: Volume I
Author: Motwani, Rajeev
Date: October 1993
Abstract: These lecture notes are based on the course CS351 (Dept. of
Computer Science, Stanford University) offered during the
academic year 1991-92. The notes below correspond to the first
half of the course. The second half consists of topics such as
AL4X SNP. cliques, and colorings, as well as more specialized
material covering topics such as geometric problems, Steiner
trees and multicommodity flows. The second half is being revised
to incorporate the implications of recent results in
approximation algorithms and the complexity of approximation
problems. Please let me know if you would like to be on the
mailing list for the second half. Comments, criticisms and
corrections are welcome, please send them by electronic mail
to rajeev@cs.Stanford.edu.
http://i.stanford.edu/pub/cstr/reports/cs/tr/92/1435/CS-TR-92-1435.pdf