2-Space bounded online cube and hypercube packing

We consider the problem of packing d-dimensional cubes into the minimum number of 2-space bounded unit cubes. Given a sequence of items, each of which is a d-dimensional (d ≥ 3) hypercube with side length not greater than 1 and an infinite number of d-dimensional (d ≥ 3) hypercube bins with unit length on each side, we want to pack all of the items in the sequence into the minimum number of bins. The constraint is that only two bins are active at anytime during the packing process. Each item should be orthogonally packed without overlapping other items. Items are given in an online manner without the knowledge of or information about the subsequent items. We extend the technique of brick partitioning for square packing and obtain two results: a three-dimensional box and d-dimensional hyperbox partitioning schemes for cube and hypercube packing, respectively. We design 5.43-competitive and 32/21 · 2^d -competitive algorithms for cube and hypercube packing, respectively. To the best of our knowledge these are the first known results on 2-space bounded cube and hypercube packing.