Bounds for online bounded space hypercube packing

Leah Epstein, Rob van Stee

Research output: Contribution to journalArticlepeer-review


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.

Original languageEnglish
Pages (from-to)185-197
Number of pages13
JournalDiscrete Optimization
Issue number2
StatePublished - 1 Jun 2007

Bibliographical note

Funding Information:
The second author’s research was supported by the Alexander von Humboldt-Stiftung.


  • Bin packing
  • Bounded space
  • Online algorithms

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computational Theory and Mathematics
  • Applied Mathematics


Dive into the research topics of 'Bounds for online bounded space hypercube packing'. Together they form a unique fingerprint.

Cite this