On dynamic bin packing: An improved lower bound and resource augmentation analysis

Algorithmica (New York)

Volumn 53, Issue 2, 2009, Pages 172-206

  Chan, Joseph Wun Tat ^a   Wong, Prudence W H ^b   Yung, Fencol C C ^c  

^a KING'S COLLEGE LONDON   (United Kingdom)

^b UNIVERSITY OF LIVERPOOL   (United Kingdom)

^c UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

BIN SIZES; BIN-PACKING PROBLEMS; COMPETITIVE ALGORITHMS; COMPETITIVE RATIOS; DYNAMIC BIN PACKINGS; LOWER BOUNDS; OFF-LINE ALGORITHMS; ON DYNAMICS; ON-LINE ALGORITHMS; RESOURCE AUGMENTATIONS;

BINS; COMPETITION; CONTROL THEORY;

ALGORITHMS;

EID: 60649095861     PISSN: 01784617     EISSN: 14320541     Source Type: Journal    
DOI: 10.1007/s00453-008-9185-z     Document Type: Article

References (18)

1. A. Bar-Noy R.E. Ladner T. Tamir 2007 Windows scheduling as a restricted version of bin packing ACM Trans. Algorithms 3 3 224 233
2. Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press, Cambridge (1998)
3. Chan, W.T., Lam, T.W., Wong, P.W.H.: Dynamic bin packing of unit fractions items. In: Proceedings of the 32nd International Colloquium on Automata, Languages and Programming (ICALP). Lecture Notes in Computer Science, vol. 3580, pp. 614-626. Springer, Berlin (2005)
4. E.G. Coffman Jr. C. Courcoubetis M.R. Garey D.S. Johnson P.W. Shor R.R. Weber M. Yannakakis 2000 Bin packing with discrete item sizes. Part I: Perfect packing theorems and the average case behavior of optimal packings SIAM J. Discrete Math. 13 38 402
5. Coffman, E.G. Jr., Galambos, G., Martello, S., Vigo, D.: Bin packing approximation algorithms: Combinatorial analysis. In: Du, D.-Z., Pardalos, P.M. (eds.) Handbook of Combinatorial Optimization. Kluwer Academic, Dordrecht (1998)
6. E.G. Coffman Jr. M. Garey D. Johnson 1987 Bin packing with divisible item sizes J. Complex. 3 405 428
7. E.G. Coffman Jr. M.R. Garey D.S. Johnson 1983 Dynamic bin packing SIAM J. Comput. 12 2 227 258
8. Coffman, E.G. Jr., Garey, M.R., Johnson, D.S.: Approximation algorithms for bin packing: A survey. In: Hochbaum, D.S. (ed.) Approximation Algorithms for NP-Hard Problems, pp. 46-93. PWS, Boston (1996)
9. Coffman, E.G. Jr., Johnson, D.S., McGeoch, L.A., Shor, P.W., Weber, R.R.: Bin packing with discrete item sizes. Part III: Average case behavior of FFD and BFD (2008, in preparation)
10. E.G. Coffman Jr. D.S. Johnson P.W. Shor R.R. Weber 1997 Bin packing with discrete item sizes. Part II: Tight bounds on first fit Random Struct. Algorithms 10 69 101
11. Csirik, J., Woeginger, G.J.: On-line packing and covering problems. In: Fiat, A., Woeginger, G.J. (eds.) On-line Algorithms-The State of the Art. Lecture Notes in Computer Science, vol. 1442, pp. 147-177. Springer, Berlin (1996)
12. J. Csirik G.J. Woeginger 2002 Resource augmentation for online bounded space bin packing J. Algorithms 44 2 308 320
13. Epstein, L., van Stee, R.: Online bin packing with resource augmentation. In: Persiano, G., Solis-Oba, R. (eds.) Proceedings of the Second International Workshop on Approximation and Online Algorithms (WAOA). Lecture Notes in Computer Science, vol. 3351, pp. 23-35. Springer, Berlin (2004)
14. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, New York (1979)
15. Z. Ivkovic E.L. Lloyd 1998 Fully dynamic algorithms for bin packing: Being (mostly) myopic helps SIAM J. Comput. 28 2 574 611
16. B. Kalyanasundaram K. Pruhs 2000 Speed is as powerful as clairvoyance J. ACM 47 4 617 643
17. S.S. Seiden 2002 On the online bin packing problem J. ACM 49 5 640 671
18. A. van Vliet 1992 An improved lower bound for on-line bin packing algorithms Inf. Process. Lett. 43 5 277 284