A compendium of NP optimization problems
Library Home 
Full Table of Contents 
Suggest a Link 
Library Help
http://www.nada.kth.se/~viggo/problemlist/compendium.html  


Crescenzi & Kann  
A continuously updated catalog of approximability results for NP optimization problems. Because no NPcomplete problem can be solved in polynomial time (unless P=NP), many approximability results (both positive and negative) of NPhard optimization problems have appeared in the technical literature. This collection includes a large number of these results. Graph theory; network design; sets and partitions; storage and retrieval; sequencing and scheduling; mathematical programming; algebra and number theory; games and puzzles; logic; automata and language theory; program optimization; bibliography; index.  


Levels:  College, Research 
Languages:  English 
Resource Types:  Link Listings, Articles, Bibliographies 
Math Topics:  Graph Theory, Logic/Foundations, Set Theory, Algebraic Number Theory, Sequences and Sets, Computer Algebra, Formal Languages and Automata 
[Privacy Policy] [Terms of Use]
© 1994 Drexel University. All rights reserved.
http://mathforum.org/
The Math Forum is a research and educational enterprise of the Drexel University School of Education.