On-line packing sequences of cubes in the unit cube

DOI10.1023/A:1004953109743zbMath0891.52009OpenAlexW104666939MaRDI QIDQ1376571

Janusz Januszewski, Marek Lassak

Publication date: 12 June 1998

Published in: Geometriae Dedicata (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1004953109743

zbMATH Keywords

volumepackingcubeon-line packing

Mathematics Subject Classification ID

Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17)

Related Items (12)

Improved Bound for Online Square-into-Square Packing ⋮ Online algorithms for 1-space bounded multidimensional bin packing and hypercube packing ⋮ Packing batches of cubes into a single bin ⋮ On-line Packing Cubes into $n$ Unit Cubes ⋮ Efficient 1-space bounded hypercube packing algorithm ⋮ On-line algorithms for 2-space bounded 2-dimensional bin packing ⋮ Online packing of \(d\)-dimensional boxes into the unit cube ⋮ Online removable square packing ⋮ Online square-into-square packing ⋮ On-line packing and covering a disk with disks ⋮ ONE-SPACE BOUNDED ALGORITHMS FOR TWO-DIMENSIONAL BIN PACKING ⋮ Online algorithms for 1-space bounded 2-dimensional bin packing and square packing

This page was built for publication: On-line packing sequences of cubes in the unit cube