Packing problems with orthogonal rotations

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

Volumn 2976, Issue , 2004, Pages 359-368

  Miyazawa, Flavio Keidi ^a   Wakabayashi, Yoshiko ^b  

^a UNIVERSITY OF CAMPINAS   (Brazil)

^b UNIVERSITY OF SÃO PAULO   (Brazil)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BINS;

ASYMPTOTIC PERFORMANCE; BIN PACKING PROBLEM; EXTENDED ABSTRACTS; ORTHOGONAL ROTATIONS; PACKING PROBLEMS; STRIP PACKING PROBLEM; THREE-DIMENSIONAL BIN PACKINGS; THREE-DIMENSIONAL PACKING;

APPROXIMATION ALGORITHMS;

EID: 35048854563     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24698-5_40     Document Type: Article

References (12)

1. B.S. Baker, E.G. Coffman Jr., and R.L. Rivest. Orthogonal packings in two-dimensions. SIAM Journal on Computing, 9:846-855, 1980.
2. F.R.K. Chung, M.R. Garey, and D.S. Johnson. On packing two-dimensional bins. SIAM Journal on Algebraic and 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, M. Lucertini, and P. Serafini, editors, Algorithms design for computer system design, pages 49-106. Spring-Verlag, New York, 1984.
4. E.G. Coffman, Jr., M.R. Garey, and D.S. Johnson. Approximation algorithms (ed. D. Hochbaum), chapter Approximation algorithms for bin packing - a survey. PWS, 1997.
5. E.G. Coffman, Jr., M.R. Garey, D.S. Johnson, and R.E. Tarjan. Performance bounds for level oriented two-dimensional packing algorithms. SIAM J. on Computing, 9:808-826, 1980.
6. W. Fernandez de la Vega and G.S. Lueker. Bin packing can be solved within 1 + ε in linear time. Combinatorica, 1(4):349-355, 1981.
7. D.S. Johnson. Near-optimal bin packing algorithms. PhD thesis, Massachusetts Institute of Technology, Cambridge, Mass., 1973.
8. C. Kenyon and E. Remila. Approximate strip packing. In 37th Annual Symposium on Foundations of Computer Science, pages 31-36, 1996.
9. K. Li and K-H. Cheng. Static job scheduling in partitionable mesh connected systems. Journal of Parallel and Distributed Computing, 10:152-159, 1990.
10. F.K. Miyazawa and Y. Wakabayashi. An algorithm for the three-dimensional packing problem with asymptotic performance analysis. Algorithmica, 18(1):122-144, 1997.
11. F.K. Miyazawa and Y. Wakabayashi. Approximation algorithms for the orthogonal z-oriented 3-D packing problem. SIAM Journal on Computing, 29(3):1008-1029, 2000.
12. V.V. Vazirani. Approximation Algorithms. Springer-Verlag, 2001.