Efficient 1-space bounded hypercube packing algorithm
From MaRDI portal
Publication:2205633
DOI10.1007/S00453-020-00723-5zbMath1476.68309OpenAlexW3033005356MaRDI QIDQ2205633
Paulina Grzegorek, Janusz Januszewski, Łukasz Zielonka
Publication date: 21 October 2020
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-020-00723-5
Analysis of algorithms (68W40) Combinatorial optimization (90C27) Online algorithms; streaming algorithms (68W27)
Uses Software
Cites Work
- Online algorithms for 1-space bounded 2-dimensional bin packing and square packing
- Multidimensional on-line bin packing: Algorithms and worst-case analysis
- A lower bound for on-line bin packing
- An improved lower bound for on-line bin packing algorithms
- Two-dimensional rectangle packing: On-line methods and results
- On-line packing sequences of cubes in the unit cube
- New bounds for multidimensional packing
- Fast algorithms for bin packing
- A note on perfect packing of \(d\)-dimensional cubes
- A note on one-space bounded square packing
- Online algorithms for 1-space bounded multidimensional bin packing and hypercube packing
- Approximation and online algorithms for multidimensional bin packing: a survey
- Drawer algorithms for 1-space bounded multidimensional hyperbox packing
- Improved Online Algorithms for 2-Space Bounded 2-Dimensional Bin Packing
- A new upper bound 2.5545 on 2D Online Bin Packing
- On the online bin packing problem
- A simple on-line bin-packing algorithm
- New Algorithms for Bin Packing
- Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
- Improved Space for Bounded-Space, On-Line Bin-Packing
- Beating the Harmonic Lower Bound for Online Bin Packing
- Efficient online packing of 4-dimensional cubes into the unit cube
- On-line bin packing in linear time
- Optimal Online Algorithms for Multidimensional Packing Problems
- Lower bounds for several online variants of bin packing
- A new lower bound for classic online bin packing
- Bounded space on-line bin packing: Best is better than first
This page was built for publication: Efficient 1-space bounded hypercube packing algorithm
