Next: Conclusion Up: How to find the Previous: Distribution of performance ratios

#
The future of the compendium

The above numbers show that the compendium seems to be considered very useful by researchers and encourage us to continue maintaining it. Updating and completing the compendium, however, is an endless work, so there will never be a final version. The compendium will be part of a new book on approximation [2], but the web version will continue to evolve after the book is printed.

It is impossible for the authors to keep up with all new approximation results presented at conferences and published in journals without help from others. In the future we will trust that any researcher publishing a new result that would fit in the compendium will report it to us. In order to facilitate this communication we have created four web forms for

1.
  entering results for a problem that already is in the compendium,
2.
  entering results for a new problem,
3.
  updating bibliography entries,
4.
  reporting errors.

The forms are available from the home page of the compendium and are designed to be easy to use.

In order to guarantee that no important results are missed we will from November 1998 engage three researchers as subeditors. Each subeditor takes care of certain sections of the compendium. The three subeditors are

- Magnus 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.

Next: Conclusion Up: How to find the Previous: Distribution of performance ratios