1. Arora, S., & Lund, C. (1996). Hardness of approximations. In D. Hochbaum (Ed.), Approximation algorithms for NP-hard problems, Chap. 10 (pp. 399–446). Boston: PWS Publishing Company.
2. Asadpour, A., & Saberi, A. (2010). An approximation algorithm for max-min fair allocation of indivisible goods. SIAM Journal on Computing, 39(7), 2970–2989.
3. Bezáková, I., & Dani, V. (2005). Allocating indivisible goods. SIGecom Exchanges, 5(3), 11–18.
4. Bouveret, S. (2007). Fair allocation of indivisible items: Modeling, computational complexity and algorithmics. Ph.D. thesis, Institut Supérieur de l’Aéronautique et de l’Espace, Toulouse.
5. Bouveret, S., Lemaître, M., Fargier, H., & Lang, J. (2005). Allocation of indivisible goods: A general model and some complexity results (extended abstract). In: Proceedings of the 4th International Joint Conference on Autonomous Agents and Multiagent Systems, (pp. 1309–1310). ACM Press.