BIB-VERSION:: CS-TR-v2.0
          ID:: STAN//CS-TR-92-1435
       ENTRY:: October 19, 1993
ORGANIZATION:: Stanford University, Department of Computer Science
       TITLE:: Lecture notes on approximation algorithms: Volume I
        TYPE:: Technical Report
      AUTHOR:: Motwani, Rajeev
       PAGES:: 82
    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.
       NOTES:: [Adminitrivia V3/ACK19940321 Added the ORGANIZATION and
               TYPE information]
               [Adminitrivia V2/ACK/19931216 Reformat authors to
               last-name, first-name.]
               [Adminitrivia V1/ACK/19931019]
         END:: STAN//CS-TR-92-1435