1 Result(s)
within
Computer Science
Algorithm Analysis and Problem Complexity
Computational Mathematics and Numerical Analysis
Fatos Xhafa
Chapter
-
Chapter and Conference Paper
Approximating scheduling problems in parallel
We show how to approximate in NC the problem of Scheduling Unrelated Parallel Machines, for a fixed number of machines. We develop a (2 + ε)-approximate parallel algorithm for the problem. Our approach shows h...
