On-line maximizing the number of items packed in variable-sized bins

Acta Cybernetica

Volumn 16, Issue 1, 2003, Pages 57-66

  Epstein, Leah ^a   Favrholdt, Lene M ^b  

^a INTERDISCIPLINARY CENTER   (Israel)

^b UNIVERSITY OF SOUTHERN DENMARK   (Denmark)

Author keywords

Bin packing; On Line

Indexed keywords

EID: 0037780449     PISSN: 0324721X     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (23)

1. J. Aspnes, Y. Azar, A. Fiat, S. Plotkin, and O. Waarts. On-Line Routing of Virtual Circuits with Applications to Load Balancing and Machine Scheduling. Journal of the ACM, 44(3):486-504, 1997.
2. Also in Proc. 25th ACM STOC, 1993, pp. 623-631.
3. S. F. Assmann, D. S. Johnson, D. J. Kleitman, and J. Y. Leung. On a Dual Version of the One-Dimensional Bin Packing Problem. Journal of Algorithms, 5:502-525, 1984.
4. Y. Azar, J. Boyar, L. Epstein, L. M. Favrholdt, K. S. Larsen, and M. N. Nielsen. Fair versus Unrestricted Bin Packing. Algorithmica, 34(2):181-196, 2002.
5. Preliminary version at SWAT 2000, volume 1851 of LNCS: 200-213, Springer-Verlag, 2000.
6. P. Berman, M. Charikar, and M. Karpinski. On-Line Load Balancing For Related Machines. Journal of Algorithms, 35:108-121, 2000.
7. A. Borodin and R. El-Yaniv. Online Compulation and Competitive Analysis. Cambridge University Press, 1998.
8. J. Boyar and K. S. Larsen. The Seat Reservation Problem. Algorithmica, 25:403-417, 1999. (Pubitemid 129661933)
9. J. Boyar, K. S. Larsen, and M. N. Nielsen. The Accommodating Function: A Generalization of the Competitive Ratio. SIAM Journal on Computing, 31(1):233-258, 2001. (Pubitemid 33779788)
10. J. L. Bruno and P. J. Downey. Probabilistic Bounds for Dual Bin-Packing. Acta Informatica, 22:333-345, 1985.
11. C. Chekuri and S. Khanna. A PTAS for the Multiple Knapsack Problem. In Proc. 11th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 213-222, 2000.
12. Y. Cho and S. Sahni. Bounds for List Schedules on Uniform Processors. SIAM Journal on Computing. 9:91-103, 1988.
13. E. G. Coffman, Jr., M. R. Garey, and D. S. Johnson. Approximation Algorithms for Bin Packing: A Survey. In Dorit S. Hochbaum, editor, Approximation Algorithms for NP-Hard Problems, chapter 2, pages 46-93. PWS Publishing Company, 1997.
14. E. G. Coffman Jr. and J. Y. Leung. Combinatorial Analysis of an Efficient Algorithm for Processor and Storage Allocation. SIAM Journal on Computing, 8(2):202-217, 1979.
15. E. G. Coffman Jr. J. Y. Leung, and D. W. Ting. Bin Packing: Maximizing the Number of Pieces Packed. Acta Informatica, 9:263-271, 1978.
16. J. Csirik and J. B. G. Freuk. A Dual Version of Bin Packing. Algorithms Review. 1:87-95, 1990.
17. J. Csirik and V. Totik. On-Line Algorithms for a Dual Version of Bin Packing. Discr. Appl. Math. 21:163-167, 1988.
18. J. Csirik and G. Woeginger. On-Line Packing and Covering Problems. In Amos Fiat and Gerhard J. Woeginger, editors, Online Algorithms, volume 1442 of LNCS, chapter 7, pages 147-177. Springer-Verlag, 1998.
19. R. L. Graham. Bounds for Certain Multiprocessing Anomalies. Bell Systems Technical Journal, 45:1563-1581, 1966.
20. J. Y. Leung. Fast Algorithms for Packing Problems. PhD thesis, Pennsylvania State University, 1977.
21. S. Martello and P. Toth. Knapsack Problems. John Wiley and Sons, Chichester, 1990.
22. J. Sgall. On-Line Scheduling In A. Fiat and G. J. Woeginger, editors, Online Algorithms: The State of the Art, volume 1442 of LNCS, pages 196-231. Springer-Verlag, 1998.
23. A. C. Yao. Towards a Unified Measure of Complexity. Proc. 12th ACM Symposium on Theory of Computing, pages 222-227, 1980.