Sciweavers

CORR
2010
Springer
133views Education» more  CORR 2010»
14 years 2 months ago
Santa Claus Schedules Jobs on Unrelated Machines
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 unrelate...
Ola Svensson
WDAG
2009
Springer
195views Algorithms» more  WDAG 2009»
14 years 8 months ago
A Local 2-Approximation Algorithm for the Vertex Cover Problem
We present a distributed 2-approximation algorithm for the minimum vertex cover problem. The algorithm is deterministic, and it runs in (∆ + 1)2 synchronous communication rounds,...
Matti Åstrand, Patrik Floréen, Valent...