Online bin packing of squares and cubes
From MaRDI portal
Publication:5925713
DOI10.1007/s00453-022-01078-9OpenAlexW3162903805MaRDI QIDQ5925713
Publication date: 28 April 2023
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-022-01078-9
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- New lower bounds for certain classes of bin packing algorithms
- A note on online hypercube packing
- An on-line algorithm for multidimensional bin packing
- Two-dimensional online bin packing with rotation
- Online algorithms. The state of the art
- Multidimensional on-line bin packing: Algorithms and worst-case analysis
- A lower bound for on-line bin packing
- Bin packing can be solved within 1+epsilon in linear time
- An improved lower bound for on-line bin packing algorithms
- Two-dimensional rectangle packing: On-line methods and results
- Lower bounds for 1-, 2- and 3-dimensional on-line bin packing algorithms
- New bounds for multidimensional packing
- Cube packing.
- Fast algorithms for bin packing
- Two-dimensional on-line bin packing problem with rotatable items.
- A lower bound for online rectangle packing
- Approximation and online algorithms for multidimensional bin packing: a survey
- Bounds for online bounded space hypercube packing
- Online square and cube packing
- Better Bin Packing Approximations via Discrepancy Theory
- 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
- On-line bin packing in linear time
- Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes
- Improved Online Hypercube Packing
- Optimal Online Algorithms for Multidimensional Packing Problems
- Tight bounds for online vector bin packing
- Lower bounds for several online variants of bin packing
- A new lower bound for classic online bin packing
This page was built for publication: Online bin packing of squares and cubes
