Beating the Harmonic Lower Bound for Online Bin Packing
From MaRDI portal
Publication:4598179
DOI10.4230/LIPIcs.ICALP.2016.41zbMath1388.68317arXiv1511.00876OpenAlexW2964069840MaRDI QIDQ4598179
Publication date: 19 December 2017
Full work available at URL: https://arxiv.org/abs/1511.00876
Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Online algorithms; streaming algorithms (68W27)
Related Items (18)
Approximation and online algorithms for multidimensional bin packing: a survey ⋮ Online bin packing with cardinality constraints resolved ⋮ Drawer algorithms for 1-space bounded multidimensional hyperbox packing ⋮ Online two-dimensional vector packing with advice ⋮ Tight bounds for NF-based bounded-space online bin packing algorithms ⋮ Unnamed Item ⋮ Efficient 1-space bounded hypercube packing algorithm ⋮ Parallel online algorithms for the bin packing problem ⋮ Fully-Dynamic Bin Packing with Little Repacking ⋮ Online bin packing of squares and cubes ⋮ The optimal absolute ratio for online bin packing ⋮ Lower bound for 3-batched bin packing ⋮ Online bin packing of squares and cubes ⋮ Lower bounds for several online variants of bin packing ⋮ Fully dynamic bin packing revisited ⋮ A new lower bound for classic online bin packing ⋮ Online bin packing with advice of small size ⋮ A tight lower bound for the online bounded space hypercube bin packing problem
This page was built for publication: Beating the Harmonic Lower Bound for Online Bin Packing
