Computers and Intractability - A Guide to the Theory of NP-Completeness - Grand Format

A readable, straightforward guide by two authors with extensive experience in the field, Computers and Intractability shows how to recognize NP-complete problems and offers practical suggestions for dealing with them effectively. The book covers the basic theory of NP-completeness, provides an overview of alternative directions for further research, and contains an extensive list of NP-complete and NP-hard problems, with more than 300 main entries and several times as many results in total.
Computers and Intractability is suitable as a supplement to courses in algorithm design, computational complexity, operations research, or combinatorial mathematics, and as a text for seminars on approximation algorithms or computational complexity. It provides not only a valuable source of information for students but also an essential reference work for professionals in computer science.