1. R. J. Anderson, E. W. Mayr, and M. K. Warmuth. Parallel approximation algorithms for bin packing. Information and Computation, 82(3):262–277, 1989.
2. D. J. Brown. A lower bound for on-line one-dimensional bin packing algorithms. Technical Report R-864, Coordinated Science Laboratory, University of Illinois, Urbana, IL, 1979.
3. E. G. Coffman, M. R. Garey, and D. S. Johnson. Dynamic bin packing. SIAM J. Comput., 12:227–258, 1983.
4. E. G. Coffman, M. R. Garey, and D. S. Johnson. Approximation algorithms for bin packing: An updated survey. In G. Ausiello, M. Lucertini and P. Serafini, editors, Algorithm Design for Computer System Design, pages 49–106. Springer, New York, 1984.
5. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to algorithms. McGraw–Hill/MIT Press, Cambridge, 2nd edition, 2001.