Lecture Schedule

Sept:

	23	Introduction to shortest paths.
		Generic label-correcting algorithm.

	28	Applications of SP formulation.
		Dijkstra's algorithm. All pairs SP. 			HW #1 handed out

	30	Minimum Spanning Trees, and spanner graphs

Oct:
	5	Introduction to Matching. Hall's Theorem

	7	*** out of town *** Guest Lecture?			HW #1 DUE

	12	Polynomial algorithm for the Assignment problem
		Stable Matching problem.				HW #2 handed out

	14	Introduction to Network flow. 
		Applications.  Generic augmentation flow

	19	Maxflow-Mincut theorem. Ford-Fulkerson algorithm.

	22	Polynomial-time maxflow algorithms.			HW #2 DUE
		Edmonds and Karp.

	26	Theory of Preflow Push.

	28	*** Midterm #1 ****

Nov:
	2 	Extensiond of maxflow; applications of Mincut 		HW #3 handed out

	4	Karger's mincut algorithm.

	9	Probabilistic Method in Combinatorics			HW #3 DUE

	11	*** Veteran's Day Holiday ***

	16	Planar Separator Theorem:		Guest Lecturer Luca Foschini
	18	Probabilistic MSTs:			Guest Lecturer Pegah Kamousi

	23	Linear Programming 1					HW #4 handed out

	25	*** Thanksgiving Holiday ***

	30	Linear Programming 2
	
Dec:
	2	*** Midterm #2 ***