||Stable matching problem: a motivating example. Asymptotic notations.||HW1. Stable
matching, basic algorithm design and analysis.
||Common running time. Basic graph algorithms: BFS and DFS||HW2. Asymptotic notations. Running time analysis.|
and its applications. Greedy algorithms.
assignment 1: implementing algorithms and evaluate running
||Greedy algorithm (cont.). Divide and conquer||HW3. Basic
graph algorithms. Greedy algorithm
||More on divide and conquer. Still more on divide and conquer: FFT.||HW4. Divide and conquer|
||Midterm exam 1.
||More on dynamic programming||HW5. Dynamic programming|
||Programming assignment 2. Dynamic programming|
||HW6. Network flows|
Midterm exam 2.
||NP problems. NP completeness: proofs.|
||NP completeness: proofs. Cope with NP completeness: heuristics and speical instances.||HW7. NP completeness.|
||HW8. Coping with NP completeness.|
to randomized algorithms.