This preview shows pages 1–13. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: Greedy schedule has 0 idle time and 0 inversions Will prove today Any two schedules with 0 idle time and 0 inversions have the same max lateness Greedy schedule has 0 idle time and 0 inversions There is an optimal schedule with 0 idle time and 0 inversions Optimal schedule with 0 idle time = = = = Lateness Only need to convert a 0 idle optimal ordering to one with 0 inversions (and 0 idle time) Only need to convert a idle optimal ordering to one with inversions (and idle time) HW 5 due today Q1, Q2 and Q3 in separate piles I will not take any HW after 1:15pm Todays agenda Exchange argument to convert an optimal solution into a 0 inversion one Shortest Path problem Shortest Path problem http://xkcd.com/85/...
View
Full
Document
This note was uploaded on 12/11/2011 for the course CSE 331 taught by Professor Rudra during the Fall '11 term at SUNY Buffalo.
 Fall '11
 RUDRA

Click to edit the document details