Online packing of \(d\)-dimensional boxes into the unit cube

DOI10.1007/s10998-020-00315-4zbMath1474.52025OpenAlexW3011820615MaRDI QIDQ2220997

Janusz Januszewski, Łukasz Zielonka

Publication date: 25 January 2021

Published in: Periodica Mathematica Hungarica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10998-020-00315-4

zbMATH Keywords

unit cubeonline packingrectangular parallelotope

Mathematics Subject Classification ID

Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15) Combinatorial aspects of packing and covering (05B40)

Related Items

Packing batches of cubes into a single bin

Cites Work

• Online square-into-square packing
• Online removable square packing
• On-line packing sequences of cubes in the unit cube
• On-line potato-sack algorithm efficient for packing into small boxes
• Packing rectangles into the unit square
• Online packing of rectangular items into square bins
• On-line \(q\)-adic covering by the method of the \(n\)-th segment and its application to on-line covering by cubes
• Improved Bound for Online Square-into-Square Packing
• Efficient online packing of 4-dimensional cubes into the unit cube
• Some packing and covering theorems
• On packing of squares and cubes