A Compendium of NP Optimization Problems

nada.kth.se
Visit Site

By P. Crescenzi and V. Kann; KTH Stockholm. A continuously updated version of the appendix from the book "Complexity and Approximation" (Springer, 1999).

Category
Books
Visits
214
Added
May 24, 2025
Rating
(77)
Rate This Site
QR Code
QR code Download PNG
Embed Badge
Place this code on your website to show you're listed here.
Get the best links delivered weekly — hand-picked from 1,200,810 resources