3 papers
cs.DS2020
Truly asymptotic lower bounds for online vector bin packing
Janos Balogh, Leah Epstein, Asaf Levin
In this work, we consider online vector bin packing. It is known that no algorithm can have a competitive ratio of in the absolute sense, though upper bounds for th…
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…