CS 577 - Introduction to Algorithms Fall 2007

Lectures

	Date	Topic	Text	Demos
1	9/4	Administrativia & Introduction	Ch 1-2	stable marriage
2	9/6	Review of Algorithmic Graph Primitives	Ch 3	BFS & DFS
3	9/11	Greedy Algorithms	§4.1-2	interval scheduling
4	9/13	Shortest Paths	§4.4-5	Dijkstra
5	9/18	Minimum Spanning Trees	§4.6,8	Kruskal & Prim
6	9/20	Huffman Codes	§5.1-3 & H	Huffman & mergesort
7	9/25	Divide and Conquer	§5.4-5 & H	counting inversions
8	9/27	Linear-Time Selection	H	selection
9	10/2	Fast Fourier Transform	§5.6
10	10/4	Dynamic Programming	§6.1-2,4
11	10/9	RNA Secondary Structure and Sequence Alignment	§6.5-7	RNA
12	10/12	Linear-Time String Matching	H	KMP
13	10/16	Recap
14	10/18	Shortest Paths Revisited	§6.8-10
15	10/23	Network Flow and Cut	§7.1-2	max flow
16	10/25	Path Augmentation	§7.3 & H
17	10/30	Bipartite Matching and Disjoint Paths	§7.5-7
18	11/1	Applications of Maximum Flow and Minimum Cut	§7.8-11
19	11/6	Randomized Algorithms	§13.12,2
20	11/8	Global Minimum Cut using Randomness	§13.2-3
21	11/13	Selection and Sorting using Randomness	§13.5-6
22	11/15	Hashing	§13.6
23	11/20	Closest Pair of Points using Randomness	§13.7
24	11/27	Reductions	§8.1-2
25	11/29	NP-Completeness	§8.3-4
26	12/4	Satisfiability	§8.4,10
27	12/6	Other NP-Complete Problems	§8.5,7-8
28	12/11	Dealing with Computational Intractability	§10.1-2
29	12/13	Approximation Algorithms	§11.3,6,8