3 citations · 3 across the 1 of their papers we have counts for
1 paper
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…