On-line packing sequences of cubes in the unit cube
From MaRDI portal
Publication:1376571
DOI10.1023/A:1004953109743zbMATH Open0891.52009OpenAlexW104666939MaRDI QIDQ1376571FDOQ1376571
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
Recommendations
Cited In (15)
- Online removable square packing
- Improved bound for online square-into-square packing
- Online packing of \(d\)-dimensional boxes into the unit cube
- On-line packing and covering a disk with disks
- On-line Packing Cubes into $n$ Unit Cubes
- Efficient online packing of 4-dimensional cubes into the unit cube
- On-line algorithms for 2-space bounded 2-dimensional bin packing
- Online algorithms for 1-space bounded 2-dimensional bin packing and square packing
- Online algorithms for 1-space bounded multidimensional bin packing and hypercube packing
- Title not available (Why is that?)
- Packing batches of cubes into a single bin
- On-line packing squares into \(n\) unit squares
- One-space bounded algorithms for two-dimensional bin packing
- Online square-into-square packing
- Efficient 1-space bounded hypercube packing algorithm
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)