Two Dimensional Packing: The Power of Rotation
Recently there is a rise in the study of two-dimensional packing problems. In such problems the input items are rectangles which need to be assigned into unit squares. However, most of the previous work concentrated on fixed items. Fixed items have a fixed direction and must be assigned so that their bottom is parallel to the bottom of the bin. In this paper we study two-dimensional bin packing of rotatable items. Those are rectangles which can be rotated by ninety degrees. We give almost tight bounds for bounded space bin packing of rotatable items, and introduce a new unbounded space algorithm. This improves the results of Fujita and Hada.
KeywordsCompetitive Ratio Horizontal Strip Space Algorithm Simple Packing Side Packing
Unable to display preview. Download preview PDF.
- 5.Epstein, L., van Stee, R.: Optimal online bounded space multidimensional packing. Technical Report SEN-E0303, CWI, Amsterdam (2003) Google Scholar
- 9.Johnson, D.S.: Near-optimal bin packing algorithms. PhD thesis, MIT, Cambridge, MA (1973) Google Scholar
- 14.Seiden, S.S., van Stee, R.: New bounds for multi-dimensional packing. In: Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2002), pp. 486–495 (2002)Google Scholar