Resource augmentation in two-dimensional packing with orthogonal rotations

Operations Research Letters

Volumn 34, Issue 1, 2006, Pages 85-93

  Correa, José R ^a  

^a UNIVERSIDAD ADOLFO IBÁÑEZ   (Chile)

Author keywords

Approximation algorithms; Bin packing; Polynomial time approximation schemes

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; POLYNOMIAL APPROXIMATION;

APPROXIMATION ALGORITHMS; BIN PACKING; POLYNOMIAL TIME APPROXIMATION SCHEMES;

PROBLEM SOLVING;

EID: 28044459797     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.orl.2005.02.005     Document Type: Article

References (16)

1. B.S. Baker, D.J. Brown, and H.P. Kasteff A 5/4 algorithm for two-dimensional packing J. Algorithms 2 1981 348 368
2. N. Bansal, J.R. Correa, C. Kenyon, M. Sviridenko, Bin packing in multiple dimensions: inapproximability results and approximation schemes, manuscript, November 2004.
3. N. Bansal, M. Sviridenko, New approximability and inapproximability results for 2-dimensional bin packing, Proceedings of the 15th Symposium on Discrete Algorithms (SODA), 2004, pp. 189-196.
4. A. Caprara, Packing 2-dimensional bins in harmony, Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science (FOCS), 2002, pp. 490-499.
5. E.G. Coffman, M.R. Garey, D.S. Johnson, and R.E. Tarjan Performance bounds for level-oriented two dimensional packing algorithms SIAM J. Comput. 9 1980 808 826
6. J.R. Correa, C. Kenyon, Approximation schemes for multidimensional packing, Proceedings of the 15th Symposium on Discrete Algorithms (SODA), 2004, 179-188.
7. L. Epstein, R. van Stee, This side up!, Proceeding of the 2nd Workshop on Approximation and Online Algorithms (WAOA), 2004, to appear.
8. C.E. Ferreira, F.K. Miyazawa, and Y. Wakabayashi Packing squares into squares Pesquisa Operacional 19 1999 223 237
9. C. Kenyon, Personal communication, October 2003.
10. C. Kenyon, and E. Remila A near optimal solution to a two-dimensional cutting stock problem Math. Oper. Res. 25 2000 645 656
11. J.Y.T. Leung, T.W. Tam, C.S. Wong, G.H. Young, and F.Y.L. Chin Packing squares into a square J. Parallel Distributed Comput. 10 1990 271 275
12. K. Li, and K.-H. Cheng Static job scheduling in partitionable mesh connected systems J. Parallel Distributed Comput. 10 1990 152 159
13. F.K. Miyazawa, and Y. Wakabayashi An algorithm for the three-dimensional packing problem with asymptotic performance analysis Algorithmica 18 1997 122 144
14. F.K. Miyazawa, and Y. Wakabayashi Approximation algorithms for the orthogonal z-oriented 3-D packing problem SIAM J. Comput. 29 2000 1008 1029
15. F.K. Miyazawa, Y. Wakabayashi, Packing problems with orthogonal rotations, Proceedings of the 6th Latin American Symposium on Theoretical Informatics (LATIN), Lecture Notes on Computer Science, vol. 2976, Springer, Berlin, 2004, pp. 359-368.
16. H. Murata, K. Fujiyoshi, S. Nakatake, and Y. Kajitani VLSI module placement based on rectangle-packing by the sequence-pair IEEE Trans. Computer-Aided Design of Integrated Circuits and Systems 15 1996 1518 1524