Computers and Intractability: A Guide to the Theory of NP-completeness (Repost)
Computers and Intractability: A Guide to the Theory of NP-completeness By Michael R. Garey, David S. Johnson
1979 | 338 Pages | ISBN: 0716710447 , 0716710455 | PDF | 13 MB
1979 | 338 Pages | ISBN: 0716710447 , 0716710455 | PDF | 13 MB
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.