Computers and Intractability: Guide to the Theory of NP-Completeness by M. R. Garey and D. S. Johnson

Book Title Computers and Intractability, Guide to the Theory of NP-Completeness
Citation Garey and Johnson (1979)
Author M. R. Garey and D. S. Johnson
Edition 1st Edition
ISBN 9780716710455
Publisher W H Freeman & Co
URL Amazon Google
Download Click Here
Course CS702 - Advanced Algorithms Analysis and Design
Instructor Dr. Nazir A. Zafar

A readable, straightforward guide by two authors with extensive experience in the field. This text shows how to recognize NP-complete problems and offers practical suggestions for dealing with them effectively. It 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.

"Shows how to recognize NP-complete problems and offers proactical 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 and extensive list of NP-complete and NP-hard problems, with more than 300 main entries and several times as many results in total. [This book] 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"--Back cover.

Related Books:
Introduction to Algorithms by T. H. Cormen, C. E. Leiserson and R. L. Rivest Introduction to Formal Languages and Automata by Peter Linz Fundamentals of Algorithmics by Gilles Brassard and Paul Bretly Discrete Mathematics and Its Applications by Kenneth Rosen