Design & Analysis of Algorithms
COMPSCI 530
Fall 2012
Lect | Date | Topic | Reference |
Linear Programming | |||
1 | 08/28 | Polyhedral Combinatorics, Simplex Algorithm | [CLRS 29,Go] |
2 | 08/30 | Simplex Algorithm | [CLRS 29,Go] |
3 | 09/04 | Duality, Farka’s Lemma | [Go,WS] |
4 | 09/06 | Primal-Dual Method (Assignment 1) | [Go] |
Network Optimization | |||
5 | 09/11 | Shortest Paths | [KT 6.8,6.9] |
6 | 09/13 | Network flows | [KT 7, CLRS26] |
7 | 09/18 | Network Flows (Assignment 1 due) | [KT 7, CLRS26] |
8 | 09/20 | Applications of Network Flows (Assignment 2) | [KT 7] |
9 | 09/25 | Bipartite Matching | [KT 7] |
Intractability | |||
10 | 09/27 | P vs NP, Polynomial-Time Reduction (Guest Lecture: Thomas Moelhave) |
[KT 8] |
11 | 10/02 | NP-Completeness and PSPACE (Assignment 2 due) | [KT 8] |
Greedy Algorithms | |||
12 | 10/04 | Vertex cover and set cover (Assignment 3) | [KT 11] |
13 | 10/09 | Local search (Guest Lecture: Sayan Bhattacharya) |
[KT12,WS] |
10/11 | Midterm (Lectures 1-12) | ||
Randomized Algorithms | |||
14 | 10/18 | Linearity of Expectation, Tail Bounds | [KT 13, MR 3] |
15 | 10/23 | Global Min-Cut (Assignment 3 due) | [KT 13, MR 10] |
16 | 10/25 | Algebraic Algorithms: Polynomial Identity, Primality Testing (Assignment 4) | [MR 7, 14], paper |
17 | 10/30 | Hashing (Guest Lecture: Kamesh Munagala) |
[KT 13, MR 8], Universal Hashing |
18 | 11/01 | Randomized LP Rounding | [KT 13,WS 5] |
19 | 11/06 | SDP Rounding (Assignment 4 due) | [WS 6] |
Geometric Algorithms | |||
20 | 11/08 | Voronoi Diagram & Delaunay Triangulation (Assignment 5) | [DO 4]] |
21 | 11/13 | Nearest-Neighbor Searching | [HP 17] |
22 | 11/15 | Locality Sensitive Hashing | |
23 | 11/20 | Locality Sensitivity Hashing [HP 20] | |
Large Scale Computation | |||
24 | 11/27 | Dimension Reduction [Mat, 15] | |
25 | 11/29 | Clustering [KT 11] | |
12/14 | Final Exam (9:00AM-NOON) |