1. N. Alon, Y. Azar, G. Woeginger, T. Yadid, Approximation schemes for scheduling, in: Proceedings of the eighth ACM/SIAM Symposium on Discrete Algorithms, ACM Press, New York, 1997, pp. 493–500.
2. Worst-case analysis of a placement algorithm related to storage allocation;Chandra;SIAM J. Comput.,1975
3. Probabilistic Analysis of Packing and Partitioning Algorithms;Coffman,1991
4. Computers and Intractability;Garey,1979
5. Partitioning ideal sets under the Lp norm;Goldberg;European J. Oper. Res.,2000