A compendium of NP optimization problems
Covering and Partitioning,
Subgraphs and Supergraphs,
Sets and Partitions
Cuts and Connectivity.
Sequencing and Scheduling
of approximability results for NP optimization problems
was last updated in 2000.
The compendium is also a part of the book
Complexity and Approximation.
There is a paper describing how the compendium is used.
We have collected some links to other lists of results.