| 1 |
Introduction, Fibonacci Heaps |
| 2 |
MST with Fibonacci Heaps, Multilevel Bucket Heaps |
| 3 |
Van Emde Boas Queues, Splay Trees |
| 4 |
Splay Trees |
| 5 |
Persistent Data Structures |
| 6 |
Suffix Trees |
| 7 |
Dynamic Connectivity |
| 8 |
Finish Dynamic Connectivity, Start Max-Flow |
| 9 |
Max-Flow and Augmenting Path Algorithms |
| 10 |
Blocking Flows, Dynamic Trees and Scaling Algorithms |
| 11 |
The Push-Relabel Algorithm |
| 12 |
Fancier Push-Relabel Algorithms, Min-Cost Flow |
| 13 |
Min-Cost Flow Properties, Basic Algorithms |
| 14 |
Min-cost Flow Algorithms |
| 15 |
Linear Programming, Formulation and Geometry |
| 16 |
Basic Solutions, Simplex Algorithm |
| 17 |
Weak Duality |
| 18 |
Strong Duality |
| 19 |
Complementary Slackness |
| 20 |
Ellipsoid Algorithm, Separation versus Optimization, Interior Point |
| 21 |
Computational Geometry, Seidel's Linear Programming Algorithm, Plane Sweep Algorithms, Range Query Data Structure |
| 22 |
Computational Geometry, More Sweep Algorithms: Convex Hull, Halfspace Intersection by Duality, Voronoi Diagrams |
| 23 |
Online Algorithms, Ski Rental, Linked-list Traversal, Load Balancing |
| 24 |
Paging |