Next: Introduction

# How to find the best approximation results
- a follow-up to Garey and Johnson1

Pierluigi Crescenzi2 - Viggo Kann3

### Abstract:

A compendium of NP optimization problems, containing the best approximation results known for each problem, is available on the world wide web at
`http://www.nada.kth.se/~viggo/problemlist/`
In this paper we describe the compendium, and specify how the compendium is consultable as well as modifiable on the web. We also give statistics for the use of the compendium.

- Introduction
- A compendium of NP optimization problems
- How is the compendium structured?
- How is the compendium used today?
- Two peculiar statistics
  - The oldest results
  - Distribution of performance ratios
- The future of the compendium
- Conclusion
- Bibliography
- About this document ...