CS 787 - Advanced Algorithms Fall 2004

For information on how to write up your scribe notes in LaTeX, check out these guidelines.

Lecture Notes

	Date	Topic	Scribes	Demos
1	9/8	Introduction	Eric Skaug	stable marriage
2	9/13	Greedy Algorithms	Marina Polishchuk, Ip Kei Sam	Dijkstra, Kruskal, Prim
3	9/15	Divide-and-Conquer and Dynamic Programming	Michael Kowalczyk, Jeff Kinne	selection
4	9/20	Network Flow	Nolan Salzmann, Greg Quinn	Ford-Fulkerson
5	9/22	NP-Completeness	Kerem Akartunali, Yana Shkel
6	9/27	Randomized Algorithms	Karthik Jayaraman, Matthew Anderson
7	9/29	Concentration	Jurgen Van Gael, Sander van der Schuyt
8	10/4	Linear Programming	Saurabh Goyal, Justin Tritz
9	10/6	LP Duality	Anand Kumar Sinha, Vinay Choudhary
10	10/11	Approximation Algorithms	Jiaqin Chen, Bee-Chung Chen
11	10/13	Greedy Approximations	Kerem Akartunali, Yana Shkel
12	10/18	More Greedy Approximations	Bee-Chung Chen, Jiaqin Chen
13	10/20	DP-Based Approximations	Michael Kowalczyk, Marina Polishchuk
14	10/25	More DP-Based Approximations	Anand Kumar Sinha, Vinay Choudhary
15	10/27	Approximating Euclidean TSP	Nolan Salzmann, Greg Quinn
16	11/1	Approximating Euclidean TSP	Sander van der Schuyt, Jurgen Van Gael
17	11/3	LP-Based Approximations	Karthik Jayaraman, Matthew Anderson
18	11/8	Randomized LP Rounding	Justin Tritz, Saurabh Goyal
19	11/10	Iterative LP Rounding	Jeff Kinne, Aparna Das
20	11/15	Primal-Dual LP Approximations	Nolan Salzmann, Gregory Quinn
21	11/17	Lagrangian LP Relaxation	Kerem Akartunali, Yanina Shkel
22	11/22	Semidefinite Programming	Jeff Kinne, Michael Kowalczyk
23	11/29	SDP-Based Approximations	Marina Polishchuk, Scott Diehl
24	12/1	Metric-Based Approximations	Anand Kumar Sinha, Vinay Choudhary
25	12/6	Approximations Using Metric Embeddings	Justin Tritz, Saurabh Goyal
26	12/8	Metric Embeddings	Jurgen Van Gael, Sander van der Schuyt
27	12/13	Divide-and-Conquer-Based Approximations on Graphs	Bee-Chung Chen, Bess Berg
28	12/15	Exact Algorithms and Heuristics	Matthew Anderson, Karthik Jayaraman