1. Alon, N., Spencer, J.H.: The Probabilistic Method, 2nd edn. Wiley, New York (1992)
2. Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., Protasi, M.: Complexity and Approximation. Combinatorial Optimization Problems and their Approximability Properties. Springer, Berlin (1999)
3. Bar-Noy, A., Bar-Yehuda, R., Freund, A., Naor, J.S., Schieber, B.: A unified approach to approximating resource allocation and scheduling. Journal of the ACM (JACM) 48(5), 1069–1090 (2001)
4. Bar-Yehuda, R., Even, S.: A local-ratio theorem for approximating the weighted vertex cover problem. Annals of Discrete Mathematics 25, 27–46 (1985)
5. Berman, P., DasGupta, B., Muthukrishnan, S., Ramaswami, S.: Improved approximation algorithms for rectangle tiling and packing. In: Proceedings of the 12th Annual ACM–SIAM Symposium on Discrete Algorithms (SODA), pp. 427–436 (2001)