42 citations · 204 across the 38 of their papers we have counts for
1 paper · 1 filter
Ola Svensson
One of the classic results in scheduling theory is the 2-approximation algorithm by Lenstra, Shmoys, and Tardos for the problem of scheduling jobs to minimize makespan on unrelated…