fa26-cs577 cs577
Lecture 13: Greedy Algorithms and Interval Scheduling Lecture 13: Greedy Algorithms and Interval Scheduling
Content locked
The catalog is public. Reading this content requires approved access.
Sign in to readLecture 13: Greedy Algorithms and Interval Scheduling
Announcement
A greedy rule needs an exchange argument
How much proof detail to write on an exam
A rule that fails: unbounded knapsack
Interval scheduling: maximize the number of activities
Rules that fail
Correct rule: earliest finish time
Why the next choice is safe
Relationship to dynamic programming
Scheduling jobs to minimize weighted completion time
Derive the ordering rule from two jobs
Why the two-job calculation still applies inside a long schedule
Huffman coding: minimize expected code length
Bottom-up greedy algorithm
Why the merge is safe