Near-Optimal Solutions to Two-Dimensional Bin Packing With 90 Degree Rotations

Electronic Notes in Discrete Mathematics

Volumn 18, Issue , 2004, Pages 89-95

  Correa, José R ^a  

^a UNIVERSITY OF CHILE   (Chile)

Author keywords

Approximation algorithms; Bin packing; Polynomial time approximation schemes

Indexed keywords

EID: 34247347820     PISSN: 15710653     EISSN: 15710653     Source Type: Journal    
DOI: 10.1016/j.endm.2004.06.014     Document Type: Article

References (13)

1. Baker B.S., Brown D.J., and Kasteff H.P. A 5/4 algorithm for two-dimensional packing. Journal of Algorithms 2 (1981) 348-368
2. N. Bansal and M. Sviridenko. "New approximability and inapproximability results for 2- dimensional bin packing." Proceedings of the 15th Symposium on Discrete Algorithms (SODA), 189-196, 2004
3. A. Caprara. "Packing 2-Dimensional Bins in Harmony." Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science (FOCS), 490-499, 2002
4. Coffman E.G., Garey M.R., Johnson D.S., and Tarjan R.E. Performance bounds for level-oriented two dimensional packing algorithms. SIAM Journal on Computing 9 (1980) 808-826
5. J. R. Correa and C. Kenyon. "Approximation Schemes for Multidimensional Packing." Proceedings of the 15th Symposium on Discrete Algorithms (SODA), 179-188, 2004
6. L. Epstein. "Two dimensional packing : the power of rotation." Proceedings of the 28th Symposium on Mathematical Foundations of Computer Science (MFCS), pages 398-407, 2003
7. C. Kenyon. Personal communication. October 2003
8. Kenyon C., and Remila E. A near optimal solution to a two-dimensional cutting stock problem. Mathematics of Operations Research 25 (2000) 645-656
9. Preliminary version in Proceedings of the 37th Symposium on Foundations of Computer Science (FOCS), 31-36, 1996
10. Leung J.Y.T., Tam T.W., Wong C.S., Young G.H., and Chin F.Y.L. Packing squares into a square. Journal of Parallel and Distributed Computing 10 (1990) 271-275
11. Miyazawa F.K., and Wakabayashi Y. An algorithm for the three-dimensional packing problem with asymptotic performance analysis. Algorithmica 18 (1997) 122-144
12. Miyazawa F.K., and Wakabayashi Y. Approximation algorithms for the orthogonal z-oriented 3-D packing problem. SIAM Journal on Computing 29 (2000) 1008-1029
13. Miyazawa F.K., and Wakabayashi Y. Packing Problems with Orthogonal Rotations. Proceedings of the 6th Latin American Symposium on Theoretical Informatics (LATIN). LNCS 2976 (2004), Springer 359-368