Optimal Online Bounded Space Multidimensional Packing

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 15, Issue , 2004, Pages 207-216

  Epstein, Leah ^a   Van Stee, Rob ^b  

^a INTERDISCIPLINARY CENTER   (Israel)

^b CWI   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; ASYMPTOTIC STABILITY; COMPUTER SCIENCE; HARMONIC ANALYSIS; MATHEMATICAL MODELS; PACKING; PROBLEM SOLVING; THEOREM PROVING;

APPROXIMATION ALGORITHMS; BIN PACKING PROBLEMS;

BOUNDARY VALUE PROBLEMS;

EID: 1842540299     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (31)

1. Nikhil Bansal and Maxim Sviridenko. New approximability and inapproximability results for 2-dimensional packing. These proceedings.
2. David Blitz, André van Vliet, and Gerhard J. Woeginger. Lower bounds on the asymptotic worst-case ratio of online bin packing algorithms. Unpublished manuscript, 1996.
3. Donna J. Brown. A lower bound for on-line one-dimensional bin packing algorithms. Technical Report R-864, Coordinated Sci. Lab., Urbana, Illinois, 1979.
4. Alberto Caprara. Packing 2-dimensional bins in harmony. In Proc. 43th IEEE Symp. on Found of Comp. Science, pages 490-499, 2002.
5. Fan R. K. Chung, Michael R. Garey, and David S. Johnson. On packing two-dimensional bins. SIAM Journal on Algebraic and Discrete Methods, 3:66-76, 1982.
6. Edward G. Coffman, Michael R. Garey, and David S. Johnson. Approximation algorithms for bin packing: a survey. In D. Hochbaum, editor, Approximation algorithms. PWS Publishing Company, 1997.
7. Don Coppersmith and Prabhakar Raghavan. Multidimensional online bin packing: Algorithms and worst case analysis. Operations Research Letters, 8:17-20, 1989.
8. Jose Correa and Claire Kenyon. Approximation schemes for multidimensional packing. These proceedings.
9. János Csirik, Johannes B. G. Frenk, and Martine Labbe. Two dimensional rectangle packing: on line methods and results. Discrete Applied Mathematics, 45:197-204, 1993.
10. János Csirik and André van Vliet. An on-line algorithm for multidimensional bin packing. Operations Research Letters, 13(3):149-158, Apr 1993.
11. János Csirik and Gerhard J. Woeginger. On-line packing and covering problems. In A. Fiat and G. J. Woeginger, editors, Online Algorithms: The State of the Art, volume 1442 of Lecture Notes in Computer Science, pages 147-177. Springer-Verlag, 1998.
12. Wenceslas Fernandez de la Vega and George S. Lueker. Bin packing can be solved within 1 + ε in linear time. Combinatorica, 1:349-355, 1981.
13. Carlos E. Ferreira, Flavio K. Miyazawa, and Yoshiko Wakabayashi. Packing squares into squares. Pesquisa Operacional, 19(2):223-237, 1999.
14. Gabor Galambos. A 1.6 lower bound for the two-dimensional online rectangle bin packing. Acta Cybernetica, 10:21-24, 1991.
15. Gabor Galambos and André van Vliet. Lower bounds for 1-, 2-, and 3-dimensional online bin packing algorithms. Computing, 52:281-297, 1994.
16. Michael R. Garey, Ronald L. Graham, and Jeffrey D. Ullman. Worst-case analysis of memory allocation algorithms. In Proceedings of the Fourth Annual ACM Symposium on Theory of Computing, pages 143-150. ACM, 1972.
17. David S. Johnson. Fast algorithms for bin packing. Journal Computer Systems Science, 8:272-314, 1974.
18. Narendra Karmarkar and Richard M. Karp. An efficient approximation scheme for the one-dimensional bin-packing problem. In Proceedings of the 23rd Annual Symposium on Foundations of Computer Science, pages 312-320, 1982.
19. Yoshiharu Kohayakawa, Flavio K. Miyazawa, Prabhakar Raghavan, and Yoshiko Wakabayashi. Multidimensional cube packing. In Jayme Szwarcfiter and Siang Song, editors, Electronic Notes in Discrete Mathematics, volume 7. Elsevier Science Publishers, 2001.
20. C. C. Lee and D. T. Lee. A simple online bin packing algorithm. Journal of the ACM, 32:562-572, 1985.
21. K. Li and K. H. Cheng. A generalized harmonic algorithm for on-line multi-dimensional bin packing, manuscript, 1990.
22. Frank M. Liang. A lower bound for online bin packing. Information Processing Letters, 10:76-79, 1980.
23. Flavio K. Miyazawa and Yoshiko Wakabayashi. Cube packing. Theoretical Computer Science, 297(1-3):355-366, 2003.
24. Steve S. Seiden. On the online bin packing problem. Journal of the ACM, 49(5):640-671, 2002.
25. Steve S. Seiden and Rob van Stee. New bounds for multi-dimensional packing. Algorithmica, 36(3):261-293, 2003.
26. Jeffrey D. Ullman. The performance of a memory allocation algorithm. Technical Report 100, Princeton University, Princeton, NJ, 1971.
27. André van Vliet. An improved lower bound for online bin packing algorithms. Information Processing Letters, 43:277-284, 1992.
28. André van Vliet. Lower and upper bounds for online bin packing and scheduling heuristics. PhD thesis, Erasmus University, Rotterdam, The Netherlands, 1995.
29. André van Vliet. On the asymptotic worst case behaviour of harmonic fit. Journal of Algorithms, 20:113-136, 1996.
30. Gerhard J. Woeginger. Improved space for bounded-space online bin packing. SIAM Journal on Discrete Mathematics, 6:575-581, 1993.
31. Andrew C. C. Yao. New algorithms for bin packing. Journal of the ACM, 21:207-227, 1980.