CS 577:
Introduction to Algorithms
Fall 2003

general information | contacts | lectures | assignments


Contacts


Lectures

  • MW 4:00-5:15 in 3345 Engineering Hall.

  • Schedule:

Date Topic Text Demos
9/3 Administrativia & Introduction Ch 1 stable marriage
9/8 Review of Algorithmic Graph Primitives Ch 2 BFS & DFS
9/10 Greedy Algorithms §3.1-2 interval scheduling
9/15 Shortest Paths & Minimum Spanning Trees §3.3-4 Dijkstra & Kruskal
9/17 Minimum Spanning Trees & Dynamic Programming §4.1-2 Prim
9/22 More Dynamic Programming §4.4-5 RNA
9/24 String Matching H & §4.6
9/29 Shortest Paths Revisited §4.7-9
10/1 Divide and Conquer §5.1-2 inversions
10/6 More Divide and Conquer §5.3-4
10/8 Linear-Time Selection H selection
10/13 Fast Fourier Transform H
10/15 Network Flow §6.1-3 max flow
10/20 Maximum Flow and Minimum Cut §6.4-5 max flow
10/22 Bipartite Matching §6.7
10/27 Applications of Maximum Flow §6.8-9 max flow apps
10/29 Applications of Minimum Cut §6.9 min cut apps
11/3 Midterm Discussion
11/5 Computational Intractability §7.1
11/10 Reductions §7.2
11/12 More Reductions §7.2
11/17 NP and NP-Completeness §7.3-4
11/19 NP-Complete Problems §7.5
11/24 More NP-Complete Problems §7.5-6
12/1 Dealing with Computational Intractability §8.1 & §9.1-2
12/3 Approximation Algorithms §10.0,8
12/8 Approximation Algorithms Based on Linear Programming §10.6
12/10 Local Search §11.1-2,5


Assignments

Assignment Out Due
Homework 0 9/3 N/A
Homework 1 9/15 9/29
Homework 2 9/29 10/13
Homework 3 10/13 10/27
Homework 4 10/27 11/10
Homework 5 11/10 11/24
Homework 6 11/24 12/8


dieter@cs.wisc.edu