Calendar

Below is the tentative schedule (subject to frequent updates, with most currently TBD). Reading assignments and references will be included.

Date	Week	Lecture	Reading
08/31	1	Introduction to Algorithm Design	Understanding Science through the Computational Lense by Richard Karp, Kleinberg and Tardos 2.1, 2.2, 2.4
09/02		Graph Basics and Depth First Search
09/07	2	Cycles and Strong Components
09/09		Graph Shortest Paths: Dijkstra and Bellman-Ford
09/14	3	Greedy Algorithms for Scheduling
09/16		Quiz 1 (In class)
09/21	4	Randomized Algorithms 1
09/23		Randomized Algorithms 2
09/28	5	Greedy Approximation: Set Cover
09/30		DP: Weighted Interval Scheduling
10/05	6	DP: LCS and Edit Distance
10/07		Quiz 2 (In class)
10/12-13	7	Fall Break
10/14		DP: Chain Matrix Multiplication
10/19	8	DP: All-Pairs Short Paths and Floyd-Warshall
10/21		Network Flows: Basic Concepts
10/26	9	Network Flows: Basic Concepts
10/28		Quiz 3 (In class)
11/2	10	Network Flows: Algorithms
11/4		Network Flows: Circulations and Applications
11/9	11	NP-Completeness: Basic Definitions
11/11		NP-Completeness: 3SAT and Independent Set
11/16	12	NP-Completeness: 3SAT and Independent Set
11/18		Quiz 4 (In class)
11/23	13	NP-Completeness: Clique, Vertex Cover, and Dominating Set
11/25-29		Thanksgiving Break
11/30	14	Approximation: Vertex Cover and TSP
12/2		Approximation: Subset Sum
12/7	15	Quiz 5 (In class)
12/9		Final Review