|
Current Version
(gzip'ed postscript, 305 kB, version of 2001/18/02)
101 pages.
|
Table of contents
(gzip'ed postscript, 82 kB, version of 2000/10/10)
|
|
|
Chapter 1 (Maximum Flow)
(gzip'ed postscript, 158 kB, version of 2000/07/20)
46 pages.
|
|
|
Chapter 2 (Graph Matching)
(gzip'ed postscript, 93 kB, version of 2000/07/20)
19 pages.
|
|
|
Chapter 3 (String Matching)
(gzip'ed postscript, 98 kB, version of 2001/18/02)
24 pages.
|
|
|
Chapter 4 (Approximation Algorithms)
(gzip'ed postscript, 75 kB, version of 2001/18/02)
12 pages.
|
|
|
Chapter 5 (Linear
Programming)
(link to chapter on Linear Programming by Goeman, MIT, version of
1994/10/01)
40 pages.
|
|
|
Chapter 6 (NP-Completeness)
( 40 Kb, version of 2001/18/02)
|
|
