A compendium of NP optimization problems, containing the best approximation results known for each problem, is now available on the web at http://www.nada.kth.se/∼viggo/problemlist/. In this paper we describe such a compendium, and specify how the compendium is consultable (and modifiable) on the world wide web.
APPROXIMATION ON THE WEB: A COMPENDIUM OF NP OPTIMIZATION PROBLEMS / P. CRESCENZI; V. KANN. - STAMPA. - (1997), pp. 111-118. (Intervento presentato al convegno INTERNATIONAL WORKSHOP ON RANDOMIZATION AND APPROXIMATION TECHNIQUES IN COMPUTER SCIENCE) [10.1007/3-540-63248-4_10].
APPROXIMATION ON THE WEB: A COMPENDIUM OF NP OPTIMIZATION PROBLEMS
CRESCENZI, PIERLUIGI;
1997
Abstract
A compendium of NP optimization problems, containing the best approximation results known for each problem, is now available on the web at http://www.nada.kth.se/∼viggo/problemlist/. In this paper we describe such a compendium, and specify how the compendium is consultable (and modifiable) on the world wide web.
File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in FLORE sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
