1. Coffman Jr., E.G., Csirik, J., Woeginger, G.J.: Approximate solutions to bin packing problems. In: Pardalos, P.M., Resende, M.G.C. (eds.) Handbook of Applied Optimization, pp. 607–615. Oxford University Press, New York (2002)
2. Csirik, J., Imreh, B.: On the worst-case performance of the NkF bin packing heuristic. Acta Cybernetica 9, 89–105 (1989)
3. Csirik, J., Johnson, D.S.: Bounded space on-line bin packing: Best is better than first. Algorithmica 31, 115–138 (2001)
4. Garey, M.R., Johnson, D.S: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)
5. Lee, C.C., Lee, D.T.: A simple on-line bin-packing algorithm. Journal of the ACM 32, 562–572 (1985)