On-line Packing Cubes into n Unit Cubes
From MaRDI portal
On-line Packing Cubes into $n$ Unit Cubes
Recommendations
- On-line covering a cube by a sequence of cubes
- Online packing of \(d\)-dimensional boxes into the unit cube
- On-line covering the unit cube by cubes
- Online square and cube packing
- Efficient online packing of 4-dimensional cubes into the unit cube
- scientific article; zbMATH DE number 2098192
- Multidimensional on-line bin packing: Algorithms and worst-case analysis
- An on-line potato-sack theorem
- Online algorithms for 1-space bounded cube packing and 2-space bounded hypercube packing
Cites work
Cited in
(12)- On-line packing sequences of segments, cubes and boxes
- On-line packing sequences of cubes in the unit cube
- On-line potato-sack algorithm efficient for packing into small boxes
- A note on perfect packing of \(d\)-dimensional cubes
- Online packing of \(d\)-dimensional boxes into the unit cube
- Drawer algorithms for 1-space bounded multidimensional hyperbox packing
- Packing cubes into a block
- On-line packing squares into n unit squares
- Efficient online packing of 4-dimensional cubes into the unit cube
- scientific article; zbMATH DE number 2098192 (Why is no real title available?)
- Reserve in packing cubes into the unit cube
- Packing of non-blocking cubes into the unit cube
This page was built for publication: On-line Packing Cubes into $n$ Unit Cubes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2957252)
