Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences)
Michael R. Garey
A readable, ordinary advisor by way of authors with vast event within the box. this article exhibits the way to realize NP-complete difficulties and provides useful feedback for facing them successfully. it's compatible as a complement to classes in set of rules layout, computational complexity, operations learn, or combinatorial arithmetic, and as a textual content for seminars on approximation algorithms or computational complexity.