1 paper · 2 filters
János Balogh, József Békési, György Dósa +2
We improve the lower bound on the asymptotic competitive ratio of any online algorithm for bin packing to above 1.54278. We demonstrate for the first time the advantage of branchin…