Top | recent changes | Preferences

Chapter ?? of CRC Handbook on Algorithms and Theory of Computation, CRC Press (1999), co-authored with Phil Klein.

A 20-page sketch of basic techniques and terms in the design and analysis of combinatorial approximation algorithms.

Sections: Introduction, Underlying principles, Approximation algorithms with small additive error, Performance guarantees, Randomized rounding and linear programming, Performance ratios and c-approximation, Polynomial approximation schemes, Constant-factor performance guarantees, Logarithmic performance guarantees, Multi-criteria problems, Hard-to-approximate problems, Research Issues and Summary, Defining Terms, Further Information.

Get a copy.

Top | recent changes | Preferences
This page is read-only | View other revisions
Last edited January 23, 2004 8:25 pm by NealYoung (diff)