On-line packing sequences of cubes in the unit cube

DOI10.1023/A:1004953109743MaRDI QIDQ1376571zbMATHOpenAlexFDO

Authors 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

volumecubepackingon-line packing

Mathematics Subject Classification ID

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

Recommendations

• On-line Packing Cubes into $n$ Unit Cubes
• Online packing of \(d\)-dimensional boxes into the unit cube
• On-line packing sequences of segments, cubes and boxes

Cited in

(16)

• Online packing of \(d\)-dimensional boxes into the unit cube
• Efficient online packing of 4-dimensional cubes into the unit cube
• On-line Packing Cubes into $n$ Unit Cubes
• Efficient 1-space bounded hypercube packing algorithm
• scientific article; zbMATH DE number 2098192 (Why is no real title available?)
• Online removable square packing
• Online algorithms for 1-space bounded 2-dimensional bin packing and square packing
• Packing of non-blocking cubes into the unit cube
• On-line packing squares into \(n\) unit squares
• One-space bounded algorithms for two-dimensional bin packing
• On-line packing and covering a disk with disks
• Online algorithms for 1-space bounded multidimensional bin packing and hypercube packing
• Reserve in packing cubes into the unit cube
• Packing batches of cubes into a single bin
• On-line algorithms for 2-space bounded 2-dimensional bin packing
• Improved bound for online square-into-square packing

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1376571)