Showing 2020Show all
2 papers · 1 filter
cs.DS2020
More on ordered open end bin packing
János Balogh, Leah Epstein, Asaf Levin
We consider the Ordered Open End Bin Packing problem. Items of sizes in are presented one by one, to be assigned to bins in this order. An item can be assigned to any bin f…
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…