Dynamic bin packing of unit fractions items

Theoretical Computer Science

Volumn 409, Issue 3, 2008, Pages 521-529

  Chan, Joseph Wun Tat ^a   Lam, Tak Wah ^b   Wong, Prudence W H ^c  

^a KING'S COLLEGE LONDON   (United Kingdom)

^b UNIVERSITY OF HONG KONG   (Hong Kong)

^c UNIVERSITY OF LIVERPOOL   (United Kingdom)

Author keywords

Bin packing; Competitive analysis; Online algorithms

Indexed keywords

ARBITRARY TIMES; BIN PACKING; COMPETITIVE ANALYSIS; COMPETITIVE RATIOS; DYNAMIC BIN PACKINGS; ONLINE ALGORITHMS; PERFORMANCE BOUNDS; SIZE BINS;

BINS;

EID: 55949118085     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2008.09.028     Document Type: Article

References (15)

1. Bar-Noy A., and Ladner R.E. Windows scheduling problems for broadcast systems. SIAM J. Comput. 32 4 (2003) 1091-1113
2. Bar-Noy A., Ladner R.E., and Tamir T. Windows scheduling as a restricted version of bin packing. ACM Trans. Algorithms 3 3 (2007) 28
3. Borodin A., and El-Yaniv R. Online Computation and Competitive Analysis (1998), Cambridge University Press
4. W.-T. Chan, P.W.H. Wong, On-line windows scheduling of temporary items, in: Proc. 15th Annual International Symposium on Algorithms and Computation, ISAAC, 2004, pp. 259-270
5. W.-T. Chan, P.W.H. Wong, F.C.C. Yung, On dynamic bin packing: An improved lower bound and resource augmentation analysis, Algorithmica (in press). http://dx.doi.org/10.1007/s00453-008-9185-z. The conference version appeared in the proceedings of the Twelfth Annual International Computing and Combinatorics Conference (COCOON'06), in: Lecture Notes in Computer Science (LNCS), vol. 4112, 2006, pp. 309-319
6. Coffman Jr. E.G., Courcoubetis C., Garey M.R., Johnson D.S., Shor P.W., Weber R.R., and Yannakakis M. Bin packing with discrete item sizes, Part I: Perfect packing theorems and the average case behavior of optimal packings. SIAM J. Discrete Math. 13 (2000) 38-402
7. Coffman Jr. E.G., Galambos G., Martello S., and Vigo D. Bin pakcing approximation algorithms: Combinatorial analysis. In: Du D.-Z., and Pardalos P.M. (Eds). Handbook of Combinatorial Optimization (1998), Kluwer Academic Publishers
8. Coffman Jr. E.G., Garey M., and Johnson D. Bin packing with divisible item sizes. J. Complexity 3 (1987) 405-428
9. Coffman Jr. E.G., Garey M.R., and Johnson D.S. Dynamic bin packing. SIAM J. Comput. 12 2 (1983) 227-258
10. Coffman Jr. E.G., Garey M.R., and Johnson D.S. Bin packing approximation algorithms: A survey. In: Hochbaum D.S. (Ed). Approximation Algorithms for NP-Hard Problems (1996), PWS Publishing 46-93
11. Csirik J., and Woeginger G.J. On-line packing and covering problems. On-line Algorithms-The State of the Art. LNCS vol. 1442 (1996) 147-177
12. Garey M.R., and Johnson D.S. Computers and Intractability: A Guide to the Theory of NP-Completeness (1979), W. H. Freeman
13. Ivkovic Z., and Lloyd E.L. Fully dynamic algorithms for bin packing: Being (mostly) myopic helps. SIAM J. Comput. 28 2 (1998) 574-611
14. Seiden S.S. On the online bin packing problem. J. ACM 49 5 (2002) 640-671
15. van Vliet A. An improved lower bound for on-line bin packing algorithms. Inf. Process. Lett. 43 5 (1992) 277-284