CS473G - Algorithms (graduate section) - Fall 2006

Date Topics Notes Reading
1 / 17 NP Completeness I [pdf] CLR 36, CLRS 34
1 / 19 NP Completeness II [pdf]  
1 / 24 NP Completeness III [pdf]  
1 / 26 Dynamic Programming [pdf] CLR 16, CLRS 15
1 / 31 More Dynamic Programming [pdf]  
2 / 2 Network Flow I [pdf] CLR 27, CLRS 26
2 / 7 Network Flow II [pdf]  
2 / 9 Network Flow III [pdf]  
2 / 14 Network Flow IV [pdf]  
2 / 16 Matchings I [pdf]  
2 / 21 Matchings II [pdf]  
2 / 23 Matchings III    
2 / 28 In class midterm [pdf]  
3 / 2 Network Flow V [pdf]  
3 / 7 Network Flow VI    
3 / 9 Network Flow VI   CLR 27, CLRS 26
3 / 14 Approximation Algorithms I [pdf]  
3 / 16 Approximation Algorithms II [pdf]  
3 / 21
3 / 23
- Spring Vacation -    
3 / 28 Approximation Algorithms III [pdf]  
3 / 30 Union-find [pdf] CLR 23
4 / 4 Randomized Algorithms I [pdf]  
4 / 6 Randomized Algorithms II [pdf]  
4 / 11 Min Cut [pdf]  
4 / 13 Max Cut [pdf]  
4 / 18 LP I [pdf]  
4 / 20 LP II [pdf]  
4 / 25 LP III [pdf]  
4 / 27 LP IV [pdf]  
5 / 2 Entropy [pdf]  
5 / 9 Final Exam   1:30 - 4:30 pm

Information regarding homework has been moved here.