Approximation Algorithms for Scheduling
Approximation Algorithms for Scheduling. O3|| C max. Partition. Given natural numbers a 1 ,…, a n , B . Is there a subset S {1,…, n }such that Reduction: n +1 jobs, p 01 = p 02 = p 03 = B, p i 1 = p i 2 = p i 3 = a i , i =1,…, n. Is there exist a schedule with C max = 3 B. M 1.
480 views • 45 slides