Efficient online packing of 4-dimensional cubes into the unit cube

DOI10.1556/012.2018.55.3.1400zbMATH Open1413.68179OpenAlexW2895936426WikidataQ129113437 ScholiaQ129113437MaRDI QIDQ4615142FDOQ4615142

Łukasz Zielonka, Janusz Januszewski

Publication date: 1 February 2019

Published in: Studia Scientiarum Mathematicarum Hungarica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1556/012.2018.55.3.1400

zbMATH Keywords

hypercubecubeonline packing

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17)

Cited In (4)

• Online packing of \(d\)-dimensional boxes into the unit cube
• On-line Packing Cubes into $n$ Unit Cubes
• Packing batches of cubes into a single bin
• Efficient 1-space bounded hypercube packing algorithm

This page was built for publication: Efficient online packing of 4-dimensional cubes into the unit cube

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