On the online bin packing problem

Journal of the ACM

Volumn 49, Issue 5, 2002, Pages 640-671

  Seiden, Steven S ^a  

^a LOUISIANA STATE UNIVERSITY   (United States)

Author keywords

Bin packing; Online algorithms

Indexed keywords

BIN PACKING; BIN PACKING ALGORITHMS; FUNDAMENTAL LOGICAL FLAWS; ONLINE ALGORITHMS;

ALGORITHMS; COMPUTER SCIENCE; ERROR ANALYSIS; FORMAL LOGIC; OPTIMIZATION; PACKING; PROBLEM SOLVING; TREES (MATHEMATICS);

ONLINE SYSTEMS;

EID: 1842550851     PISSN: 00045411     EISSN: None     Source Type: Journal    
DOI: 10.1145/585265.585269     Document Type: Article

References (15)

1. BROWN, D. J. 1979. A lower bound for on-line one-dimensional bin packing algorithms. Tech. Rep. R-864, Coordinated Sci. Lab., University of Illinois at Urbana-Champaign, Urbana, Ill.
2. COFFMAN, E. G., GAREY, M. R., AND JOHNSON, D. S. 1997. Approximation algorithms for bin packing: A survey. In Approximation Algorithms for NP-hard Problems, D. Hochbaum, Ed. PWS Publishing Company, Chap. 2.
3. CSIRIK, J. 1989. An on-line algorithm for variable-sized bin packing. Acta Info. 26 (8), 697-709.
4. CSIRIK, J., AND WOEGINOER, G. 1998, On-line packing and covering problems. In On-Line Algorithms -The State of the Art, A. Fiat and G. Woeginger, Eds, Lecture Notes in Computer Science, Springer-Verlag, New York, Chap. 7.
5. CSIRIK, J., AND WOEOINGER, G. 2000. Resource augmentation for online bounded space bin packing. In Proceedings of the 27th International Colloquium on Automata, Languages and Programming (July). pp. 296-304.
6. JOHNSON, D. S. 1974. Fast algorithms for bin packing. J. Comput. Syst. Sci. 8, 272-314.
7. JOHNSON, D. S., DEMERS, A., ULLMAN, J. D., GAREY, M. R., AND GRAHAM, R. L. 1974. Worst-case performance bounds for simple one-dimensional packing algorithms. SIAM J. Comput. 3, 256-278.
8. LEE, C., AND LEE, D. 1985. A simple on-line bin-packing algorithm. J. ACM 32, 3 (July), 562-572.
9. LIANG, F. M. 1980. A lower bound for online bin packing. Info. Proc. Lett. 10, 76-79.
10. RAMANAN, P., BROWN, D., LEE, C., AND LEE, D. 1989. On-line bin packing in linear time. J. Algorithms 10, 3 (Sept.), 305-326.
11. RICHEY, M. B. 1991. Improved bounds for harmonic-based bin packing algorithms. Discr. Appli. Math. 34, 203-227.
12. SEIDEN, S. S. 2001. An optimal online algorithm for bounded space variable-sized bin packing. SIAM J. Discr. Math. 14, 4, 458-470.
13. ULLMAN, J. D. 1971. The performance of a memory allocation algorithm. Tech. Rep. 100, Princeton University, Princeton, N.J., Oct.
14. VAN VLIET, A. 1992. An improved lower bound for online bin packing algorithms. Info. Proc. Lett. 43, 5 (Oct.), 277-284.
15. YAO, A. C. C. 1980. New algorithms for bin packing. J. ACM 27, 207-227.