1. Lecture Notes in Computer Science;G.J. Woeginger,2003
2. Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., Protasi, M.: Complexity and approximation. In: Combinatorial optimization problems and their approximability properties. Springer, Berlin (1999)
3. Hochbaum, D.S. (ed.): Approximation algorithms for NP-hard problems. PWS, Boston (1997)
4. Vazirani, V.: Approximation algorithms. Springer, Berlin (2001)
5. Arora, S., Lund, C., Motwani, R., Sudan, M., Szegedy, M.: Proof verification and intractability of approximation problems. J. Assoc. Comput. Mach. 45, 501–555 (1998)