Differences
This shows you the differences between two versions of the page.
| Both sides previous revisionPrevious revision | |||
| courses:cs211:winter2014:journals:emily:entryfive [2014/02/26 04:50] – [Chapter 4.4] hardye | courses:cs211:winter2014:journals:emily:entryfive [2014/02/26 04:51] (current) – [Chapter 4.2] hardye | ||
|---|---|---|---|
| Line 51: | Line 51: | ||
| **(4.10) The schedule A produced by the greedy algorithm has optimal maximum lateness L.** | **(4.10) The schedule A produced by the greedy algorithm has optimal maximum lateness L.** | ||
| + | The exchange argument is still pretty confusing to me I'd like to see a detailed outline of it. The book confused me after the lecture we had in class. | ||
| + | |||
| + | Readability 8/10 | ||
| ====== Chapter 4.4 ====== | ====== Chapter 4.4 ====== | ||
| **Shortest Paths in a Graph** | **Shortest Paths in a Graph** | ||
