New bounds for variable-sized online bin packing

SIAM Journal on Computing

Volumn 32, Issue 2, 2003, Pages 455-469

  Seiden, Steven S ^a   Van Stee, Rob ^b   Epstein, Leah ^c  

^a Louisiana State University   (United States)

^b UNIVERSITY OF FREIBURG   (Germany)

^c INTERDISCIPLINARY CENTER   (Israel)

Author keywords

Bin packing; Online algorithms

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; FRACTALS; PROBLEM SOLVING;

FRACTAL-LIKE CURVES; ONLINE BIN PACKING;

BOUNDARY CONDITIONS;

EID: 0038624377     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539702412908     Document Type: Article

References (21)

1. D. J. Brown, A Lower Bound for On-Line One-Dimensional Bin Packing Algorithms, Tech. report R-864, Coordinated Science Laboratory, Urbana, IL, 1979.
2. B. Chandra, Does randomization help in on-line bin packing?, Inform. Process. Lett., 43 (1992), pp. 15-19.
3. E. G. Coffman, M. R. Garey, and D. S. Johnson, Approximation algorithms for bin packing: A survey, in Approximation Algorithms for NP-Hard Problems, D. Hochbaum, ed., PWS Publishing, boston, 1997, Chap. 2.
4. J. Csirik, An on-line algorithm for variable-sized bin packing, Acta Inform., 26 (1989), pp. 697-709.
5. J. Csirik and G. Woeginger, On-line packing and covering problems, in On-Line Algorithms-The State of the Art, Lecture Notes in Comput. Sci. 1442, A. Fiat and G. Woeginger, eds., Springer-Verlag, New York, 1998, pp. 147-177.
6. L. Epstein, On-line variable sized covering, Inform. and Comput., 171 (2001), pp. 294-305.
7. D. K. Friesen and M. A. Langston, A storage-size selection problem, Inform. Process. Lett., 18 (1984), pp. 295-296.
8. D. K. Friesen and M. A. Langston, Variable sized bin packing, SIAM J. Comput., 15 (1986), pp. 222-230.
9. D. S. Johnson, Near-Optimal Bin Packing Algorithms, Ph.D. thesis, MIT, Cambridge, MA, 1973.
10. D. S. Johnson, Fast algorithms for bin packing, J. Comput. System Sci., 8 (1974), pp. 272-314.
11. D. S. Johnson, A. Demers, J. D. Ullman, M. R. Garey, and R. L. Graham, Worst-case performance bounds for simple one-dimensional packing algorithms, SIAM J. Comput., 3 (1974), pp. 299-325.
12. N. Kinnersley and M. Langston, Online variable-sized bin packing, Discrete Appl. Math., 22 (1989), pp, 143-148.
13. C. Lee and D. Lee, A simple on-line bin-packing algorithm, J. ACM, 32 (1985), pp. 562-572.
14. F. M. Liang, A lower bound for online bin packing, Inform. Process. Lett., 10 (1980), pp. 76-79.
15. P. Ramanan, D. Brown, C. Lee and D. Lee, On-line bin packing in linear time, J. Algorithms, 10 (1989), pp. 305-326.
16. M. B. Richey, Improved bounds for harmonic-based bin packing algorithms, Discrete Appl. Math., 34 (1991), pp. 203-227.
17. S. S. Seiden, On the online bin packing problem, in Proceedings of the 28th International Colloquium on Automata, Languages and Programming, Crete, Greece, 2001, pp. 237-249.
18. S. S. Seiden, An optimal online algorithm for bounded space variable-sized bin packing, SIAM J. Discrete Math., 14 (2001), pp. 458-470.
19. A. van Vliet, An improved lower bound for online bin packing algorithms, Inform. Process. Lett., 43 (1992), pp. 277-284.
20. G. Woeginger and G. Zhang, Optimal on-line algorithms for variable-sized bin covering, Oper. Res. Lett., 25 (1999), pp. 47-50.
21. A. C. C. Yao, New algorithms for bin packing, J. ACM, 27 (1980), pp. 207-227.