1. Arora, S., Lund, C.: Hardness of approximations. In: Hochbaum, D. (ed.) Approximation Algorithms for NP-Hard Problems, chap. 10, pp. 399–446. PWS Publishing Company (1996)
2. Asadpour, A., Saberi, A.: An approximation algorithm for max-min fair allocation of indivisible goods. In: Proceedings of the 39th ACM Symposium on Theory of Computing, pp. 114–121. ACM Press, New York (2007)
3. Asadpour, A., Saberi, A.: An approximation algorithm for max-min fair allocation of indivisible goods. SIAM J. Comput. 39(7), 2970–2989 (2010)
4. Bansal, N., Sviridenko, M.: The Santa Claus problem. In: Proceedings of the 38th ACM Symposium on Theory of Computing, pp. 31–40. ACM Press, New York (2006)
5. Bezáková, I., Dani, V.: Allocating indivisible goods. SIGecom Exchanges 5(3), 11–18 (2005)