Greedy Algorithm
Digest from Algorithm Design
‣ Interval Scheduling
Given many small intervals and a bigger interval. To fit the most smaller intervals possible into the bigger intervals.
‣ Interval Partitioning
Given many small intervals and some classrooms. To fit all smaller intervals into the classrooms without conflicts such that the number of classrooms should be the minimum possible.
‣ Scheduling to minimize lateness
Given many small intervals and some classrooms. To fit all smaller intervals into the classrooms without conflicts such that the number of classrooms should be the minimum possible.
‣Overview
Last updated