1. Arora, S., and Lund, C. (1997), Hardness of approximations, chapter 10 of [11]. PWS, 1997.
2. Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti Spaccamela, A., and Protasi, M. (1997), Approximate solution of NP-hard optimization problems. To appear (a preliminary version of some chapters is available on request to one of the authors).
3. Bovet, D., and Crescenzi, P. (1993), Introduction to the Theory of Complexity. Prentice Hall.
4. Bertsimas, D., Teo, C-P., and Vohra, R. (1996), “On dependent randomized rounding algorithms”, Proc. 5th Int. Conf. on Integer Prog. and Combinatorial Optimization, Lecture Notes in Comput. Sci. 1084, Springer-Verlag, 330–344.
5. Crescenzi, P., Kann, V., Silvestri, R., and Trevisan, L. (1995), “Structure in approximation classes”, Proc. 1st Ann. Int. Conf. on Computing and Combinatorics, Lecture Notes in Comput. Sci. 959, Springer-Verlag, 539–548.