84 citations · 241 across the 22 of their papers we have counts for
Showing 2018 · cs.DSShow all
2 papers · 2 filters
cs.DS2018
A new lower bound for classic online bin packing
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…
cs.DS2018★ 47 cited
A Parameterized Strongly Polynomial Algorithm for Block Structured Integer Programs
Martin Koutecký, Asaf Levin, Shmuel Onn
The theory of -fold integer programming has been recently emerging as an important tool in parameterized complexity. The input to an -fold integer program (IP) consists of pa…