Princeton University
Computer Science Department

Computer Science 423
Theory of Algorithms

Kevin Wayne

Spring 2005

General Information   |     Lecture Notes   |     Problem Sets

Problem Sets

Problem sets will be due Wednesday at the beginning of lecture. They will be posted here one week prior to the due date. Here are guidelines on writing solutions.


# DUE ASSIGNMENT PRECEPT
1 2/9 Stable matching, greed problems
2 2/16 Greedy algorithms problems
3 2/23 Divide-and-conquer problems
4 3/2 Dynamic programming problems
5 3/23 Network flow problems
6 4/6 Intractability problems
7 4/20 Coping with intractability problems
8 5/4 Randomization problems