Cube packing

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1776 LNCS, Issue , 2000, Pages 58-67

  Miyazawa, F K ^a   Wakabayashi, Y ^b  

^a UNIVERSITY OF CAMPINAS   (Brazil)

^b UNIVERSITY OF SÃO PAULO   (Brazil)

Author keywords

[No Author keywords available]

Indexed keywords

ASYMPTOTIC PERFORMANCE; CUBE PACKING; OFF-LINE ALGORITHM; OFFLINE; ON-LINE ALGORITHMS; PACKING PROBLEMS;

APPROXIMATION ALGORITHMS; INFORMATION SCIENCE; ALGORITHMS; GEOMETRY;

GEOMETRY; APPROXIMATION ALGORITHMS;

EID: 84896756340     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/10719839_6     Document Type: Conference Paper

References (14)

1. B. S. Baker, A. R. Calderbank, E. G. Coffman Jr., and J. C. Lagarias. Approximation algorithms for maximizing the number of squares packed into a rectangle. SIAM J. Algebraic Discrete Methods, 4(3):383-397, 1983.
2. F. R. K. Chung, M. R. Garey, and D. S. Johnson. On packing two-dimensional bins. SIAM J. Algebraic Discrete Methods, 3:66-76, 1982.
3. E. G. Coffman, Jr., M. R. Garey, and D. S. Johnson. Approximation algorithms for bin packing - an updated survey. In G. Ausiello et al. (eds.) Algorithms design for computer system design, 49-106. Springer-Verlag, New York, 1984.
4. E. G. Coffman, Jr., M. R. Garey, and D. S. Johnson. Approximation algorithms for bin packing - a survey. In D. Hochbaum (ed.) Approximation algorithms for NP-hard problems, 46-93, PWS, 1997.
5. E. G. Coffman Jr. and J. C. Lagarias. Algorithms for packing squares: A probabilistic analysis. SIAM J. Comput., 18(1):166-185, 1989.
6. D. Coppersmith and P. Raghavan. Multidimensional on-line bin packing: algorithms and worst-case analysis. Oper. Res. Lett., 8(1):17-20, 1989.
7. J. Csirik and A. van Vliet. An on-line algorithm for multidimensional bin packing. Operations Research Letters, 13:149-158, 1993.
8. H. Dyckhoff, G. Scheithauer, and J. Terno. Cutting and packing. In F. Maffioli, M. Dell'Amico and S. Martello (eds.) Annotated Bibliographies in Combinatorial Optimization, Chapter 22, 393-412. John Wiley, 1997.
9. C. E. Ferreira, F. K. Miyazawa, and Y. Wakabayashi. Packing squares into squares. Pesquisa Operacional, a special volume on cutting and packing. To appear.
10. K. Li and K.-H. Cheng. A generalized harmonic algorithm for on-line multidimensional bin packing. TR UH-CS-90-2, University of Houston, January 1990.
11. K. Li and K.-H. Cheng. Generalized first-fit algorithms in two and three dimensions. Int. J. Found. Comput Sci., 1(2):131-150, 1992.
12. A. Meir and L. Moser. On packing of squares and cubes. J. Combinatorial Theory Ser. A, 5:116-127, 1968.
13. F. K. Miyazawa and Y. Wakabayashi. Approximation algorithms for the orthogonal z-oriented three-dimensional packing problem. To appear in SIAM J. Computing.
14. F. K. Miyazawa and Y. Wakabayashi. An algorithm for the three-dimensional packing problem with asymptotic performance analysis. Algorithmica, 18(1):122-144, 1997.