Abstract
We consider two- and three-dimensional bin packing problems where 90° rotations are allowed. We improve all known asymptotic performance bounds for these problems. In particular, we show how to combine ideas from strip packing and two-dimensional bin packing to give a new algorithm for the three-dimensional strip packing problem where boxes can only be rotated sideways. We propose to call this problem ‘This side up’. Our algorithm has an asymptotic performance bound of 9/4.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bansal, N., Sviridenko, M.: New approximability and inapproximability results for 2-dimensional packing. In: Proceedings of the 15th Annual Symposium on Discrete Algorithms, pp. 189–196. ACM/SIAM (2004)
Caprara, A.: Packing 2-dimensional bins in harmony. In: Proc. 43th IEEE Symp. on Found. of Comp. Science, pp. 490–499 (2002)
Coffman, E.G., Garey, M.R., Johnson, D.S., Tarjan, R.E.: Performance bounds for level oriented two-dimensional packing algorithms. SIAM Journal on Computing 9, 808–826 (1980)
Correa, J., Kenyon, C.: Approximation schemes for multidimensional packing. In: Proceedings of the 15th ACM/SIAM Symposium on Discrete Algorithms, pp. 179–188. ACM/SIAM (2004)
Dell’Amico, M., Martello, S., Vigo, D.: A lower bound for the non-oriented two-dimensional bin packing problem. Discrete Applied Mathematics 118, 13–24 (2002)
Epstein, L.: Two dimensional packing: The power of rotation. In: Rovan, B., Vojtáš, P. (eds.) MFCS 2003. LNCS, vol. 2747, pp. 398–407. Springer, Heidelberg (2003)
Epstein, L., van Stee, R.: Optimal online bounded space multidimensional packing. In: Proc. of 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2004), pp. 207–216. ACM/SIAM (2004)
Fujita, S., Hada, T.: Two-dimensional on-line bin packing problem with rotatable items. Theoretical Computer Science 289(2), 939–952 (2002)
Li, K., Cheng, K.-H.: Static job scheduling in partitionable mesh connected systems. Journal on Parallel and Distributed Computing 10, 152–159 (1990)
Miyazawa, F.K., Wakabayashi, Y.: Approximation algorithms for the orthogonal z-oriented 3-d packing problem. SIAM Journal on Computing 29(3), 1008–1029 (2000)
Miyazawa, F.K., Wakabayashi, Y.: Packing problems with orthogonal rotations. In: Farach-Colton, M. (ed.) LATIN 2004. LNCS, vol. 2976, pp. 359–368. Springer, Heidelberg (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Epstein, L., van Stee, R. (2005). This Side Up!. In: Persiano, G., Solis-Oba, R. (eds) Approximation and Online Algorithms. WAOA 2004. Lecture Notes in Computer Science, vol 3351. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31833-0_6
Download citation
DOI: https://doi.org/10.1007/978-3-540-31833-0_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24574-2
Online ISBN: 978-3-540-31833-0
eBook Packages: Computer ScienceComputer Science (R0)