A fundamental restriction on fully dynamic maintenance of bin packing

Information Processing Letters

Volumn 59, Issue 4, 1996, Pages 229-232

  Ivković, Zoran ^a   Lloyd, Errol L ^b  

^a YALE SCHOOL OF MANAGEMENT   (United States)

^b University of Delaware   (United States)

Author keywords

Algorithms; Bin packing

Indexed keywords

EID: 0042040478     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/0020-0190(96)00112-3     Document Type: Article

References (13)

1. R.J. Anderson, E.W. Mayr and M.K. Warmuth, Parallel approximation algorithms for bin packing, Inform. and Comput. 82 (1989) 262-277.
2. D.J. Brown, A lower bound for on-line one-dimensional bin packing algorithms, Tech. Rept. R-864, Coordinated Science Laboratory, University of Illinois, Urbana, IL, 1979.
3. E.G. Coffman, M.R. Garey and D.S. Johnson, Dynamic bin packing, SIAM J. Comput. 12 (1983) 227-258.
4. E.G. Coffman, M.R. Garey and D.S. Johnson, Approximation algorithms for bin packing: An updated survey, in: G. Ausiello, M. Lucertini and P. Serafini, eds., Algorithm Design for Computer System Design (Springer, New York, 1984) 49-106.
5. T.H. Corman, C.E. Leiserson and R.L. Rivest, Introduction to Algorithms (MIT Press, Cambridge, MA, 1990).
6. W. Fernandez de la Vega and G.S. Lueker, Bin packing can be solved within 1 + ε in linear time, Combinatorica 1 (4) (1981) 349-355.
7. G. Gambosi, A. Postiglione and M. Talamo, New algorithms for on-line bin packing, in: G. Aussiello, D.P. Bovet and R. Petreschi, eds., Algorithms and Complexity, Proc. 1st Italian Conf. (World Scientific, Singapore, 1990) 44-59.
8. Z. Ivković and E.L. Lloyd, Fully dynamic algorithms for bin packing: Being (mostly) myopic helps, Proc. 1st European Symp. on Algorithms, Lecture Notes in Computer Science 726 (Springer, New York, 1993) 224-235; also: SIAM J. Comput., to appear.
9. Z. Ivković and E.L. Lloyd, Fully dynamic algorithms for bin packing: Being (mostly) myopic helps, Proc. 1st European Symp. on Algorithms, Lecture Notes in Computer Science 726 (Springer, New York, 1993) 224-235; also: SIAM J. Comput., to appear.
10. F.M. Liang, A lower bound for on-line bin-packing, Inform. Process. Lett. 10 (1980) 76-79.
11. C.C. Lee and D.T. Lee, A simple on-line bin-packing algorithm.. J. ACM 3 (1985) 562-572.
12. P. Ramanan, D.J. Brown, C.C. Lee and D.T. Lee, On-line bin-packing in linear time, J. Algorithms 3 (1989) 305-326.
13. A.C.-C. Yao, New algorithms for bin packing, J. ACM 27 (2) (1980) 207-277.