An optimal online algorithm for bounded space variable-sized bin packing

SIAM Journal on Discrete Mathematics

Volumn 14, Issue 4, 2001, Pages 458-470

  Seiden, Steven S ^a  

^a Louisiana State University ^*  (United States)

Author keywords

Bin packing; Lower bounds; Online algorithms

Indexed keywords

EID: 0037487601     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895480100369948     Document Type: Article

References (20)

1. D. J. BROWN, 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-Champaign, IL, 1979.
2. R. BURKARD AND G. ZHANG, Bounded space on-line variable-sized bin packing, Acta Cybernet., 13 (1997), pp. 63-76.
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. Hochbuam, ed., PWS, Boston MA, 1997. pp. 46-93.
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, A. Fiat and G. Woeginger, eds., Lecture Notes in Comput. Sci. 1136, Springer-Verlag, Berlin, 1996. pp. 147-177.
6. D. K. FRIESEN AND M. A. LANGSTON, A storage-size selection problem, Inform. Process. Lett., 18 (1984), pp. 295-296.
7. D. K. FRIESEN AND M. A. LANGSTON, Variable sized bin packing, SIAM J. Comput., 15 (1986), pp. 222-230.
8. D. S. JOHNSON, Near-Optimal Bin Packing Algorithms, Ph.D. thesis, Massachusetts Institute of Technology, Cambridge, MA, 1973.
9. D. S. JOHNSON, Fast algorithms for bin packing, J. Comput Systems Sci., 8 (1974), pp. 272-314.
10. D. S. JOHNSOK, 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.
11. N. KINNERSLEY AND M. LANGSTON, Online variable-sized bin packing. Discrete Appl. Math., 22 (1989), pp. 143-148.
12. C. LEE AND D. LEE, A simple on-line bin-packing algorithm, J. ACM, 32 (1985), pp. 562-572.
13. F. M. LIANG, A lower bound for online bin packing, Inform. Process. Lett., 10 (1980), pp. 76-79.
14. P. RAMANAN, D. BROWN, C. LEE, AND D. LEE, On-line bin packing in linear time, J. Algorithms, 10 (1989), pp. 305-326.
15. M. B. RICHEY, Improved bounds for harmonic-based bin packing algorithms. Discrete Appl. Math., 34 (1991), pp. 203-227.
16. 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.
17. A. VAN VLIET, An improved lower bound for online bin packing algorithms. Inform. Process. Lett., 43 (1992), pp. 277-284.
18. G. WOEGINGER, Improved space for bounded-space, on-line bin-packing, SIAM J. Discrete Math., 6 (1993), pp. 575-581.
19. A. C. C. YAO, New algorithms for bin packing, J. ACM, 27 (1980), pp. 207-227.
20. G. ZHANG, Worst-case analysis of the FFH algorithm for online variable-sized bin packing, Computing, 56 (1996), pp. 165-172.