CSCI-570: Analysis of Algorithms
Fall 2019
This schedule is meant as an outline. Depending on progress, material may be added or removed. Also, there will often be interesting tangents to follow.
| Date | Topics Covered | Discussion | |
|---|---|---|---|
| 1 | Aug. 20 – 24 | Course Overview & Review (Timing Analysis, Trees and Graphs, Proofs) |
no discussions |
| 2 | Aug. 27 – 31 | Amortized Analysis, Binomial Heaps HW1 due Aug. 31 |
dis. 1 (review) |
| 3 | Sep. 03 – 07 | Greedy Algorithms HW2 due Sep. 07 |
dis. 2 (ac, heaps) |
| 4 | Sep. 10 – 14 | Master Theorem, D&C HW3 due Sep. 14 |
dis. 3(mst, dijkstra) |
| 5 | Sep. 17 – 21 | Dynamic Programming HW4 due Sep. 21 |
dis. 4 (D&C) |
| 6 | Sep. 24 – 28 | Dynamic Programming HW5 due Sep. 28 |
dis. 5 (DP) |
| 7 | Oct. 01 – 05 | Review for exam Exam – I (on Friday, Oct. 05) |
dis. 6 (DP) |
| 8 | Oct. 08 – 12 | Network Flow | no discussions |
| 9 | Oct. 15 – 19 | Network Circulation HW6 due Oct. 19 |
dis. 7 (flow) |
| 10 | Oct. 22 – 26 | NP-Completeness HW7 due Oct. 26 |
dis. 8 (flow) |
| 11 | Oct. 29 – Nov. 2 | Linear Programming Lagrangian duality HW8 due Nov. 02 |
dis. 9 (NP) |
| 12 | Nov. 05 – 09 | Approximation Algorithms Online Algorithms |
dis. 10 (approx) |
| 13 | Nov. 12 – 16 | Randomized Algorithms HW9 due Nov. 16 |
dis. 11 (LP) |
| 14 | Nov. 26 – 30 | Review for exam Exam – II (on Friday, Nov. 30) |
dis. 12 (review) |