| Notes |
Date |
| Rudiments of Probability |
January 9 |
| Tail Bounds |
January 14 |
| Computational Complexity |
January 16 |
| Feedback Vertex Set - Part I |
February 18 |
| Feedback Vertex Set - Part II |
February 21 |
| Shortest Superstring |
February 24 |
| Knapsack |
March 17 |
| Bin-Packing (Combinatorial) |
March 17 |
| Minimum Makespan (Combinatorial) |
March 18 |
| Bin-Packing (Asymptotic PTAS)) |
March 21 |
| Minimum Makespan (PTAS) |
March 24 |
| LP Duality |
March 24 |
| Dual Fitting for Set Cover |
March 25 |
| LP Rounding for Set Cover |
April 1 |
| Primal-Dual Schema for Set
Cover |
April 4 |
| Max-SAT |
April 7 |
| Fundamentals of Semidefinite Programming |
April 14 |
| Max-Cut approximation through
semidefinite programming |
April 15 |