Source code online books for professionals by professionals

Approximation: Combinatorial Optimization Problems and Their Approximability Properties. Springer. Appendix 
online: 
ftp://ftp.nada.kth.se/Theory/Viggo-Kann/compendium.pdf
.
Garey, M. R. and Johnson, D. S. (2003). Computers and Intractability: A Guide to the Theory of NP-Completeness.  
W. H. Freeman and Company.
Goldreich, O. (2010). P, NP, and NP-Completeness: The Basics of Computational Complexity. Cambridge University Press.
Harel, D. (2000). Computers Ltd: What They Really Can’t Do. Oxford University Press.
Hemaspaandra, L. A. and Ogihara, M. (2002). The Complexity Theory Companion. Springer.
Hochbaum, D. S., editor (1997). Approximation Algorithms for NP-Hard Problems. PWS Publishing Company.
Impagliazzo, R. (1995). A personal view of average-case complexity. In Proceedings of the 10th Annual Structure in 
Complexity Theory Conference (SCT ’95), pages 134–147. 
http://cseweb.ucsd.edu/~russell/average.ps
.

---

Chapter 11 
■
 hard problems and (lImIted) sloppIness
253
Kolesar, P. J. (1967). A branch and bound algorithm for the knapsack problem. Management Science, 13(9):723–735. 
http://www.jstor.org/pss/2628089
.
Vazirani, V. V. (2010). Approximation Algorithms. Springer.
Williamson, D. P. and Shmoys, D. B. (2011). The Design of Approximation Algorithms. Cambridge University Press. 
http://www.designofapproxalgs.com
.

---

255