Lecture Schedule

Mar 28 Administrivia and Course Overview. Calibration Quiz Chapters 1-3, Chapter 4.4, Chapter 5.1-5.2
Mar 30 Minimum Spanning Trees. Kruskal and Prim. Union-Find Data structure Chapter 4.5-4.6. Section 5.1.4 of this book chapter (from Dasgupta, Papadimitriou and Vazirani)
Apr 4 Rest of Union-Find. Heaps. Optimal Cache Replacement. Chapter 2.5. Chapter 4.3 Slides
Apr 6 Greedy approximation algorithms - k-center and set cover. Integer Multiplication. Strassen's algorithm for Matrix Multiplication. Chapters 11.1-11.2. Chapter 5.5 Slides
Apr 11 Closest pair of points. String Reconstruction. Chapter 5.4. Chapter 6 Slides
Apr 13 Longest Common Subsequence. Edit Distance. Subset Sum. Independent Set on Trees. Chapter 6 Slides
Apr 18 Independent Set in Trees. All Pairs Shortest Paths. Network Flows. Started with Ford Fulkerson Algorithm. Chapter 6. Chapter 7.1, 7.2 Slides
Apr 20 Continue with Ford Fulkerson. Scaling. Start with Preflow-Push. Chapter 7.1-7.3 Slides
Apr 25 Preflow Push Chapter 7.4 Slides
Apr 27 Preflow Push: Running Time Analysis Chapter 7.4 Slides
May 2 Bipartite Matching Chapter 7.5 Slides
May 4 Midterm
May 9 Midterm Solutions. Bipartite Matching and Blocking Flows. Slides
May 11 Randomized Algorithms. Contention Resolution. Properties of Random Variables. Chapter 13 Slides
May 16 Karger's Min-Cut Algorithm. Randomized Selection. Chapter 13 Slides
May 18 Randomized Sorting. Started with MAX-3SAT. Chapter 13 Slides
May 23 MAX-3SAT. Three Concentration Inequalities. Chapter 13 Slides
May 25 Balls and bins and Hashing. Chapter 13 Slides
Jun 1 Practice Problems.