1. Michael R. Garey and David S. Johnson. Computers and intractability : a guide to the theory of NP-completeness, A Series of books in the mathematical sciences.. W. H. Freeman, San Francisco, 1979.
   Note: Michael R. Garey, David S. Johnson. Includes indexes. Bibliography: p. [291]-325. NP-completeness.
   Keywords: computational complexity, algorithms, honours reading. [bibtex-entry]

1. David S. Johnson. Local optimization and the traveling salesman problem. In M. S. Paterson, editor, Automata, Languages and Programming. 17th International Colloquium Proceedings; Coventry, UK, Berlin, Germany, pages p. ix+780, 446--61, 1990. Springer-Verlag.
   Keywords: algorithms, honours reading. [bibtex-entry]

Disclaimer: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All person copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.