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

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1853, Issue , 2000, Pages 283-295

  Seiden, Steven S ^a  

^a Louisiana State University   (United States)

Author keywords

Bin packing; Lower bounds; Online algorithms

Indexed keywords

AUTOMATA THEORY;

BIN PACKING; BOUNDED SPACES; LOWER BOUNDS; ON-LINE ALGORITHMS; OPTIMAL PERFORMANCE; OPTIMUM VALUE; PERFORMANCE RATIO; VARIABLE SIZED BIN PACKING;

OPTIMIZATION;

EID: 84974528113     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45022-x_25     Document Type: Conference Paper

References (17)

1. Brown, D. J. A lower bound for on-line one-dimensional bin packing algorithms. Tech. Rep. R-864, Coordinated Sci. Lab., University of Illinois at Urbana- Champaign, 1979.
2. Burkard, R., and Zhang, G. Bounded space on-line variable-sized bin packing. Acta Cybernetica 13, 1 (1997), 63–76.
3. Coffman, E. G., Garey, M. R., and Johnson, D. S. Approximation algorithms for bin packing: A survey. In Approximation Algorithms for NP-hard Problems, D. Hochbuam, Ed. PWS Publishing Company, 1997, ch. 2.
4. Csirik, J. An on-line algorithm for variable-sized bin packing. Acta Informatica 26, 8 (1989), 697–709.
5. Csirik, J., and Woeginger, G. 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, 1998, ch. 7.
6. Friesen, D. K., and Langston, M. A. Variable sized bin packing. SIAM Journal on Computing 15 (1986), 222–230.
7. Johnson, D. S. Near-optimal bin packing algorithms. PhD thesis, Massachusetts Institute of Technology, Cambridge, Massachusetts, 1973.
8. Johnson, D. S. Fast algorithms for bin packing. Journal Computer Systems Science 8 (1974), 272-314.
9. Johnson, D. S., Demers, A., Ullman, J. D., Garey, M. R., and Graham, R. L. Worst-case performance bounds for simple one-dimensional packing algorithms. SIAM Journal on Computing 3 (1974), 256-278.
10. Kinnersley, N., and Langston, M. Online variable-sized bin packing. Discrete Applied Mathematics 22, 2 (Feb 1989), 143-148.
11. Lee, C., and Lee, D. A simple on-line bin-packing algorithm. Journal of the ACM 32, 3 (Jul 1985), 562-572.
12. Liang, F. M. A lower bound for online bin packing. Information Processing Letters 10 (1980), 76-79.
13. Ramanan, P., Brown, D., Lee, C., and Lee, D. On-line bin packing in linear time. Journal of Algorithms 10, 3 (Sep 1989), 305-326.
14. Richey, M. B. Improved bounds for harmonic-based bin packing algorithms. Discrete Applied Mathematics 34 (1991), 203-227.
15. van Vliet, A. An improved lower bound for online bin packing algorithms. Information Processing Letters 43, 5 (Oct 1992), 277-284.
16. Yao, A. C. C. New algorithms for bin packing. Journal of the ACM 27 (1980), 207-227.
17. Zhang, G. Worst-case analysis of the FFH algorithm for online variable-sized bin packing. Computing 56, 2 (1996), 165-172.