Design & Analysis of Algorithms
COMPSCI 532
Fall 2014
Lect | Date | Topic | Reference |
Linear Programming | |||
1 | 08/26 | Polyhedral Combinatorics, Simplex Algorithm | [CLRS 29,Go] |
2 | 08/28 | Simplex and Ellipsoid Algorithms | [CLRS 29,Go] |
3 | 09/02 | Duality, Farka’s Lemma | [Go,WS] |
4 | 09/04 | Primal-Dual Method | [Go] |
Network Optimization | |||
5 | 09/09 | Shortest Paths & Fibonacci Heaps | [KT 6.8,6.9] |
6 | 09/11 | Network flows | [KT 7, CLRS26] |
7 | 09/13 | Network Flows | [KT 7, CLRS26] |
8 | 09/18 | Bipartite Matching | [KT 7] |
Intractability | |||
9 | 09/23 | P vs NP, Polynomial-Time Reduction | [KT 8] |
10 | 09/25 | NP-Completeness | [KT 8] |
11 | 09/30 | Beyond NP-Completeness | [KT 8] |
Greedy Algorithms | |||
12 | 10/02 | Vertex cover and set cover | [KT 11] |
13 | 10/07 | Multiplicative Weight Method | [KT12,WS] |
10/09 | Midterm (Lectures 1-12) | ||
14 | 10/16 | Clustering | [KT 11] |
Randomized Algorithms | |||
15 | 10/21 | Linearity of Expectation | [KT 13] |
16 | 10/23 | Global Min-Cut | [KT 13, MR 10] |
17 | 10/28 | Hashing | [KT 13, MR 8] |
18 | 10/30 | LP Rounding | [KT 13,WS 5] |
19 | 11/04 | SDP Rounding | [WS 6] |
Geometric Algorithms | |||
20 | 11/06 | Voronoi Diagram & Delaunay Triangulation | [dBCKO] |
21 | 11/11 | Nearest-Neighbor Searching | [HP] |
22 | 11/13 | Locality Sensitive Hashing | [HP] |
Large Scale Computation | |||
23 | 11/18 | Sublinear algorithms | [HP, Ru] |
24 | 11/20 | Dimension Reduction | [Mat 15] |
25 | 11/29 | Streaming | [Mu] |
12/10 | Final Exam (All lectures) 07:00-10:00 pm |