2004
Bounds for online bounded space hypercube packing
Publication
Publication
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
| Additional Metadata | |
|---|---|
| , , | |
| CWI | |
| Software Engineering [SEN] | |
| Organisation | Intelligent and autonomous systems |
|
Epstein, L., & van Stee, R. (2004). Bounds for online bounded space hypercube packing. Software Engineering [SEN]. CWI. |
|
