|
Lecture 1: Introduction
Lecture 2: D&C
Lecture 3: Stable Marriage [demo]
Lecture 4: Max Flow [Demo]
Lecture 5: Applications of Network Flows
Lecture 6: PageRank
Lecture 7: Reductions and NP
Lecture 8: NP-Completeness
Lecture 9: Approximation and Hardness of Approximation
Lecture 10: Linear Programming
Lecture 11: Backwards Analysis and LP
Lecture 12: Approximations using LP
Lecture 13: DP and PTAS using DP
Lecture 14: Randomized Algorithms
Lecture 15: D&C: PRAM Introduction
Lecture 16: Parallel Algorithms
Lecture 17: Online Algorithms
|
No comments:
Post a Comment