A new lower bound for classic online bin packing
From MaRDI portal
Publication:5918895
DOI10.1007/978-3-030-39479-0_2OpenAlexW3001995001MaRDI QIDQ5918895
Asaf Levin, Leah Epstein, József Békési, János Balogh, György Dósa
Publication date: 24 August 2020
Published in: Approximation and Online Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1807.05554
Related Items (15)
Lower bounds for batched bin packing ⋮ Online bin packing with overload cost ⋮ Constant-Ratio Approximation for Robust Bin Packing with Budgeted Uncertainty ⋮ A note on a variant of the online open end bin packing problem ⋮ Efficient 1-space bounded hypercube packing algorithm ⋮ Parallel online algorithms for the bin packing problem ⋮ Best fit bin packing with random order revisited ⋮ Online bin packing of squares and cubes ⋮ Online bin packing of squares and cubes ⋮ Lower bounds for several online variants of bin packing ⋮ A new lower bound for classic online bin packing ⋮ Online bin covering with advice ⋮ Best Fit Bin Packing with Random Order Revisited ⋮ A Robust AFPTAS for Online Bin Packing with Polynomial Migration ⋮ A lower bound for online rectangle packing
This page was built for publication: A new lower bound for classic online bin packing
