A compendium of NP optimization problems

Editors:
Pierluigi Crescenzi, piluc@dsi.unifi.it and Viggo Kann, viggo@nada.kth.se
Subeditors:
Magnús Halldórsson
Graph Theory: Covering and Partitioning, Subgraphs and Supergraphs, Sets and Partitions.
Marek Karpinski
Graph Theory: Vertex Ordering, Network Design: Cuts and Connectivity.
Gerhard Woeginger
Sequencing and Scheduling.


This is a copy of the April 1999 version of the on-line web version of the compendium that also appears in the appendix of the book. The on-line version is continuously updated, so check there for the latest results.

You can use web forms to report new problems, new results on existing problems, updates of references or errors.

There is a paper describing how the compendium is used.





Viggo Kann
1999-07-20