Dynamic bin packing of unit fractions items

Lecture Notes in Computer Science

Volumn 3580, Issue , 2005, Pages 614-626

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

^a UNIVERSITY OF HONG KONG   (Hong Kong)

^b UNIVERSITY OF LIVERPOOL   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER PROGRAMMING; PACKING;

ARBITRARY TIME; DYNAMIC BIN PACKING; UNIT FRACTION ITEMS;

COMPUTER SCIENCE;

EID: 26444553310     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11523468_50     Document Type: Conference Paper

References (15)

1. A. Bar-Noy and R. E. Ladner. Windows scheduling problems for broadcast systems. SIAM J. Comput., 32(4):1091-1113, 2003.
2. A. Bar-Noy, R. E. Ladner, and T. Tamir. Windows scheduling as a restricted version of bin packing. In J. I. Munro, editor, SODA, pages 224-233. SIAM, 2004.
3. A. Borodin and R. El-Yaniv. Online Computation and Competitive Analysis. Cambridge University Press, 1998.
4. W.-T. Chan and P. W. H. Wong. On-line windows scheduling of temporary items. In R. Fleischer and G. Trippen, editors, ISAAC, volume 3341 of Lecture Notes in Computer Science, pages 259-270. Springer, 2004.
5. E. G. Coffman, Jr., C. Courcoubetis, M. R. Garey, D. S. Johnson, P. W. Shor, R. R. Weber, and M. Yannakakis. 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, 2000.
6. E. G. Coffman, Jr., G. Galambos, S. Martello, and D. Vigo. Bin pakcing approximation algorithms: Combinatorial analysis. In Handbook of Combinatorial Optimization. Kluwer Academic Publishers, 1998.
7. E. G. Coffman, Jr., M. Garey, and D. Johnson. Bin packing with divisible item sizes. Journal of Complexity, 3:405-428, 1987.
8. E. G. Coffman, Jr., M. R. Garey, and D. S. Johnson. Dynamic bin packing. SIAM J. Comput., 12(2):227-258, 1983.
9. E. G. Coffman, Jr., M. R. Garey, and D. S. Johnson. Bin packing approximation algorithms: A survey. In D. S. Hochbaum, editor, Approximation Algorithms for NP-Hard Problems, pages 46-93. PWS, 1996.
10. J. Csirik and G. J. Woeginger. On-line packing and covering problems. In A. Fiat and G. J. Woeginger, editors, On-line Algorithms - The State of the Art, volume 1442 of Lecture Notes in Computer Science, pages 147-177. Springer, 1996.
11. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, San Francisco, 1979.
12. Z. Ivkovic and E. L. Lloyd. Fully dynamic algorithms for bin packing: Being (mostly) myopic helps. SIAM J. Comput, 28(2):574-611, 1998.
13. M. B. Richey. Improved bounds for harmonic-based bin packing algorithms. Discrete Applied Mathematics, 34:203-227, 1991.
14. S. S. Seiden. On the online bin packing problem. J. ACM, 49(5):640-671, 2002.
15. A. van Vliet. An improved lower bound for on-line bin packing algorithms. Inf. Process. Lett., 43(5):277-284, 1992.