Teo4

13 Março 2018, 13:00 • Isabel Gama Nunes

Greedy algorithms

Interval scheduling (the greedy algorithm stays ahead).

Scheduling all intervals (a structural bound argument).

Scheduling to minimize lateness (an exchange argument).