Lecture Topics F 2008

  • 1. 9/25/08. Introduction (Types of analysis)
  • Dynamic Programming: Points to lines (6.3), RNA folding (6.5)

  • 2. 9/30/08. Finish 6.5, Sequence alignment (6.6) linear space (6.7),

  • 3. 10/2/08 linear space analysis (6.7),Shortest paths (6.8-6.9, bit of 6.10),

  • 4. 10/7/08 Network Flows (7.1,72): problem definition, Residual graphs, Ford-Fulkerson algorithm

  • 5. 10/9/08 Network Flows: Scaling algorithm, application to bipartite matching, disjoint paths (7.3, 7.5,7.6)

  • 6. 10/14/08 Network Flow applications, more on disjoint paths/network vulnerability (7.6), 7.5 (max-matching = min-cover), Project Selection (7.11), Baseball (7.12).

  • 7. 10/16/08 advanced graph algorithms (summary 7.13) Hard Problems: P, NP, reductions, NP-hard problems (8.1)

  • 8. 10/21/08 Hard Problems: (8.1,8.2), NP, decision versus optimization, subset sum reductions, weak and strong NP-hardness (8.8),

  • 9. 10/23/08 Pspace (9.1,9.2), Dealing with hard problems, special cases: 10.1 Small Vertex Covers, 10.2 Independent Set on trees

  • 10. 10/28/08 10.2 Independent Set, Approximations, vertex cover, Scheduling 11.1,

  • 11. 10/30/08 Midterm

  • 12. 11/4/08 Midterm solutions, k-center 11.2, Set cover started 11.3

  • 13. 11/6/08 Set cover finished (11.3), Vertex cover 11.4

  • 14. 11/13/08 Disjoint paths 11.5, 11.8 knapsack,

  • 15. 11/18/08 linear programming/integer programming 11.6, VC approx (11.6), Branch-bound

  • 16. 11/19/08 Local Search (12.1), Simulated Annealing (brief) (12.2) Randomized algorithms: contention resolution (13.1), randomized Min-cut (13.2)

  • 17. 11/20/08 Randomized Max-SAT (13.4), Hashing (13.6), Perfect Hashing (CLRS 11.5)

  • 18. 12/2/08 Closest Point (13.7), intro to Primality Testing (see link),

  • 19. 12/04/08 Primality Testing (see link, and Cormen, Leiserson, Rivest 31.8),

  • 20. 12/7 Randomized Caching (13.8)