Lectures

LectDateTopicReference
Linear Programming
1 08/30 Theory of LP [MG 4, Goe 9]
2 09/01 Simplex and Other Algorithms [MG 5,7; Goe 10,11]
3 09/06 Duality, Farka’s Lemma [MG 6, Goe 10]
4 09/08 LP Duality, Lagrangian Duality [MG 6, BV 5]
Network Optimization
5 09/13 Min-Cut Max-Flow [KT 7, Eri 23]
6 09/15 Max-Flow Algorithms [KT 7, Eri 23]
7 09/20 Min-Cost Bipartite Matching [KT 7]
8 09/22 Matching [HK, Kuh 2]
Intractability
9 09/27 P vs NP, Polynomial-Time Reduction [KT 8, Eri 30]
10 09/29 NP-Completeness [KT 8, Eri 30]
11 10/04 Beyond NP-Completeness [KT 9]
Greedy Algorithms
12 10/06 Vertex cover and set cover [KT 11, WS 01]
Exam 10/13 Midterm (Lectures 1-12)
13 10/18 Clustering [KT 12,WS 02]
14 10/20 Facility Location [WS 07, 09]
Randomized Algorithms
15 10/25 Expectation & Tail Bounds [KT 13]
16 10/27 Global Min-Cut [KT 13]
17 11/01 Polynomial Identity Testing [MR 7]
18 11/03 LP Rounding [KT 13,WS 5]
19 11/08 SDP Rounding [WS 6]
Geometric Algorithms
20 11/10 Nearest-Neighbor Searching [HP]
21 11/15 Approximate Nearest-Neighbor Searching [HP]
22 11/17 Dimension Reduction [Mat 15]
Hashing
23 11/22 Universal Hashing, Bloom Filters [MR 8, Eri 12]
24 11/29 Locality Sensitive Hashing [HP]
25 12/01 Linear Sketches [Mu]
Exam 12/14 Final Exam (All lectures)
07:00-10:00 pm

page top