Showing 2017Show all
2 papers · 1 filter
cs.DS2017
Lower bounds for several online variants of bin packing
János Balogh, József Békési, György Dósa +2
We consider several previously studied online variants of bin packing and prove new and improved lower bounds on the asymptotic competitive ratios for them. For that, we use a meth…
cs.DS2017
A new and improved algorithm for online bin packing
János Balogh, József Békési, György Dósa +2
We revisit the classic online bin packing problem. In this problem, items of positive sizes no larger than 1 are presented one by one to be packed into subsets called "bins" of tot…