Date:         Mon, 24 Jan 2000 00:58:10 +0100
From: Viggo Kann 
Subject:      New book: Complexity and Approximation
To: THEORYNT@listserv.nodak.edu

ANNOUNCEMENT OF A NEW TEXTBOOK IN COMPLEXITY AND APPROXIMATION

The book "Complexity and Approximation - Combinatorial optimization
problems and their approximability properties" by G. Ausiello,
P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-Spaccamela, and
M. Protasi has recently been published by Springer Verlag.

Contents:
1. The complexity of optimization problems
2. Design techniques for approximation algorithms
3. Approximation classes
4. Input-dependent and asymptotic approximation
5. Approximation through randomization
6. NP, PCP and non-approximability results
7. The PCP theorem
8. Approximation preserving reductions
9. Probabilistic analysis of approximation algorithms
10. Heuristic methods
Appendix A. Mathematical preliminaries
Appendix B. A list of NP optimization problems

The book can be used both as a textbook in senior undergraduate
courses and graduate courses, and as a reference for researchers.
Appendix B consists of Kann's and Crescenzi's compendium of more than
200 NP optimization problems with approximability results.

More information can be found on the web site of the book:

http://www.nada.kth.se/~viggo/approxbook/


and on Springer's web site at:

http://www.springer.de/cgi-bin/search_book.pl?isbn=3-540-65431-3