1. Asano Asano, T. , T., Iwama Iwama, K. , K., Takada Takada, H. , H., and Yamashita Yamashita, Y. , Y. [2000]: Designing high-quality approximation algorithms for combinatorial optimization problems. IEICE Transactions on Communications/Electronics/Information and Systems E83-D (2000), 462–478
2. Ausiello Ausiello, G. , G., Crescenzi Crescenzi, P. , P., Gambosi Gambosi, G. , G., Kann Kann, V. , V., Marchetti-Spaccamela Marchetti-Spaccamela, A. , A., and Protasi Protasi, M. , M. [1999]: Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties. Springer, Berlin 1999
3. Garey Garey, M.R. , M.R., and Johnson Johnson, D.S. , D.S. [1979]: Computers and Intractability; A Guide to the Theory of NP-Completeness. Freeman, San Francisco 1979, Chapter 4
4. Hochbaum Hochbaum, D.S. , D.S. [1996]: Approximation Algorithms for NP-Hard Problems. PWS, Boston, 1996
5. Horowitz Horowitz, E. , E., and Sahni Sahni, S. , S. [1978]: Fundamentals of Computer Algorithms. Computer Science Press, Potomac 1978, Chapter 12