Author Archives: piersab

For Lecture 36 we studied Weighted Interval Scheduling and the use of Dynamic Programming. A quick review of the lecture is followed with the formula: M[j] = max {Vj + M[p(j), M(j+10]}. Inputs provided: n jobs (Si, Ti, Vi) Outputs … Continue reading →