Sciweavers

DISOPT
2007

Bounds for online bounded space hypercube packing

13 years 3 months ago
Bounds for online bounded space hypercube packing
In hypercube packing, we receive a sequence of hypercubes that need to be packed into unit hypercubes which are called bins. Items arrive online and each item must be placed within its bin without overlapping with other items in that bin. The goal is to minimize the total number of bins used. We present lower and upper bounds for online bounded space hypercube packing in dimensions 2, . . . , 7.
Leah Epstein, Rob van Stee
Added 13 Dec 2010
Updated 13 Dec 2010
Type Journal
Year 2007
Where DISOPT
Authors Leah Epstein, Rob van Stee
Comments (0)