3 citations · 5 across the 4 of their papers we have counts for
1 paper · 1 filter
Christos Kalaitzis, Ola Svensson, Jakub Tarnawski
We consider the classic problem of scheduling jobs on unrelated machines so as to minimize the weighted sum of completion times. Recently, for a small constant ε>0, B…