50 citations · 64 across the 7 of their papers we have counts for
1 paper · 1 filter
Martin Böhm, Matej Lieskovský, Sören Schmitt +2
We break the barrier of 3/2 for the problem of online load balancing with known makespan, also known as bin stretching. In this problem, m identical machines and the optimal ma…