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.
Original language | English |
---|---|
Pages (from-to) | 48-60 |
Number of pages | 13 |
Journal | Lecture Notes in Computer Science |
Volume | 3351 |
DOIs | |
State | Published - 2005 |
Externally published | Yes |
Event | Second International Workshop on Approximation and Online Algorithms, WAOA 2004 - Bergen, Norway Duration: 14 Sep 2004 → 16 Sep 2004 |
ASJC Scopus subject areas
- Theoretical Computer Science
- General Computer Science