Computer and intractability: a guide to the theory of NP-completeness by David S. Johnson, Michael R. Garey

Computer and intractability: a guide to the theory of NP-completeness



Download eBook




Computer and intractability: a guide to the theory of NP-completeness David S. Johnson, Michael R. Garey ebook
ISBN: 0716710447, 9780716710448
Format: djvu
Publisher: W.H.Freeman & Co Ltd
Page: 175


Today I'll review the wonderful Computers and Intractability: A Guide to the Theory of NP-Completeness . Freeman Company, November 1990. Johnson: Computers and Intractability: A Guide to the Theory of NP-Completeness. The electronic version of this article is the complete one and can be found online at: http://www.almob.org/content/2/1/15 Garey M, Johnson D: Computers and Intractability: A Guide to the Theory of NP-Completeness. Garey, Michael R., and David S. €�Algorithm for Solving Large-scale 0-. Ɂ�去の講義で何度も使った、Garey & Johnson: ``Computers and Intractability: A Guide to the Theory of NP-Completeness". Computers and Intractability: A Guide to the Theory of NP-Completeness. Harary, F., Graph Theory, Addison-Wesley, Reading, MA, 1969. Garey, M.R., and Johnson, D.S., Computers and Intractability : A Guide to the Theory of NP-Completeness, W.H. Freeman & Co., New York, NY, USA. This book has been the very first book on NP-completeness. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, 338pp. [2] Giuseppe Di Battista, Peter Eades, Roberto Tamassia, and Ioannis G. Posted on July 9, This entry was posted in Uncategorized and tagged Computers, Guide, Intractability, NPCompleteness, Theory. First published in 1979, it presents a thorough compendium of NP-complete problems (which was updated in later printings of the book). Computers and Intractability; A Guide to the Theory of NP-Completeness, W.H. Computers and Intractability: A Guide to the Theory of Np-Completeness.