- Computational Complexity - http://www.springerlink.com/link.asp?id=101499
(Birkhäuser) Tables of contents from vol.7 (1998) on. Full text to subscribers via LINK.
- Complexity and Approximation - http://www.nada.kth.se/~viggo/approxbook/
Combinatorial optimization problems and their approximability properties: by G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-Spaccamela, M. Protasi (Springer, 1999). Table of contents, errata, software supplement and a continuously updated catalog of approximability results.
|