On-line algorithms for 2-space bounded 2-dimensional bin packing

Authors:
Janusz Januszewski
Affiliations:
Institute of Mathematics and Physics, University of Technology and Life Sciences, al. prof. Kaliskiego 7, 85-796 Bydgoszcz, Poland
Venue:
Information Processing Letters
Year:
2012

Citing 4
Cited 0

On-line grid-packing with a single active grid

Information Processing Letters
Packing 2-Dimensional Bins in Harmony

FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes

Mathematics of Operations Research
Online Removable Square Packing

Theory of Computing Systems

Quantified Score

Hi-index	0.89

Visualization

Abstract

In 2-space bounded model of on-line bin packing, there are 2 active bins, and each item can be packed only into one of the active bins. If it is impossible to pack an item into any active bin, we close one of the current active bins and open a new active bin to pack that item. In 2-space bounded 2-dimensional bin packing problem, each item is a rectangle of side lengths not greater than 1. The items are packed on-line into square bins of size 1x1 and 90^o-rotations are allowed. In this paper a 4-competitive 2-space bounded 2-dimensional on-line packing algorithm is presented. Furthermore, an on-line strategy with competitive ratio 3.8 is given for 2-space bounded square packing.