A simple on-line bin-packing algorithm
Journal of the ACM (JACM)
On-line bin packing in linear time
Journal of Algorithms
An improved lower bound for on-line bin packing algorithms
Information Processing Letters
Two-dimensional rectangle packing: on-line methods and results
Discrete Applied Mathematics - ARIDAM IV and V
A lower bound for the non-oriented two-dimensional bin packing problem
Discrete Applied Mathematics - Special issue: Third ALIO-EURO meeting on applied combinatorial optimization
On the online bin packing problem
Journal of the ACM (JACM)
Two-dimensional on-line bin packing problem with rotatable items
Theoretical Computer Science
Optimal Online Algorithms for Multidimensional Packing Problems
SIAM Journal on Computing
Fast algorithms for bin packing
Journal of Computer and System Sciences
SIAM Journal on Computing
A new upper bound 2.5545 on 2D Online Bin Packing
ACM Transactions on Algorithms (TALG)
Absolute approximation ratios for packing rectangles into bins
Journal of Scheduling
Bounds for online bounded space hypercube packing
Discrete Optimization
An on-line algorithm for multidimensional bin packing
Operations Research Letters
Multidimensional on-line bin packing: Algorithms and worst-case analysis
Operations Research Letters
| Hi-index | 5.23 |
In two-dimensional bin packing problems, the input items are rectangles which need to be packed in a non-overlapping manner. The goal is to assign the items into unit squares using an axis-parallel packing. Most previous work on online packing concentrated on items of fixed orientation, which must be assigned such that their bottom side is parallel to the bottom of the bin. In this paper we study the case of rotatable items, which can be rotated by ninety degrees. We give almost tight bounds on the (asymptotic) competitive ratio of bounded space bin packing of rotatable items, and introduce a new unbounded space algorithm. This improves the results of Fujita and Hada.