Many of these lectures are based on your book Algorithm Design by Kleinberg and Tardos. See it for more detail.
Tentative Schedule:
# | Topics | Links & Reading |
---|---|---|
1 | Case Study: Minimum Spanning tree
|
AD Ch. 1, 2.5, 4.5, 3.1 |
2 |
|
AD Ch. 2, 4.6 |
3 | Graph Algorithms I
|
AD Ch. 3 |
4 | Graph Algorithms II
|
AD 4.4, 6.8 |
5 | Divide and Conquer Algorithms
|
AD 5.1-5.2,5.4,5.6 |
6 | Dictionary Data Structures
|
|
7 | Dynamic Programming Algorithms
|
AD 6.1-5 |
8 | More Dynamic Programming Algorithms
|
AD 6.6-6.8 |
9 | Network Flow Algorithms
|
AD 7.1-7.3,7.5,7.7,7.8 |
10 | Linear and Integer Programming Algorithms
|
AD 11.6 (brief discussion) |
11 | NP-completeness
|
AD 8.1-8.7 |
12 | Summary
|
"AD" indicates sections in the Algorithm Design textbook.