Lower Bound for the Online Bin Packing Problem with Restricted Repacking
From MaRDI portal
Publication:3614164
DOI10.1137/050647049zbMath1165.68032OpenAlexW2028545499MaRDI QIDQ3614164
János Balogh, Gábor Galambos, József Békési, Gerhard Reinelt
Publication date: 16 March 2009
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/a8fd1e3f45576d7cbc3f4618baaa23b7e83a2ced
Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)
Related Items
Semi-on-line bin packing: a short overview and a new lower bound, Dynamic bin packing with unit fraction items revisited, On-line bin packing with restricted repacking, Fully-Dynamic Bin Packing with Little Repacking, Fully dynamic bin packing revisited, Improved lower bounds for semi-online bin packing problems, A Robust AFPTAS for Online Bin Packing with Polynomial Migration