Author:
Crescenzi Pierluigi,Kann Viggo
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.
Publisher
Association for Computing Machinery (ACM)
Reference15 articles.
1. Ausiello G . . Crescenzi P. . Gambosi G . Kann V . Marchetti Spaccamela. A . and Protasi. M . (1999) . Approximate solution of NP-hard optimization problems . Springer-Verlag . To appear.
2. Bertsimas D .
.
Teo
.
C-P
. . and
Vohra R .
(
1996
) . "
On dependent randomized rounding algorithms
" . Proc. 5th hit . Cont. on Integer Frog . and Combinatorial Optimization Lecture Notes in Comput
. Sci. 108-1 Springer-Verlag 330-344 .
3. Lecture Notes i n Comput . Sci . 959;Crescenzi P .,1995
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献