CSE 421: Introduction to Algorithms
Assignment #3
January 23, 2002
Due: Wednesday, January 30
Reading Assignment: Kleinberg and Tardos, chapter 3.
Problems
For all problems on this homework, prove that your algorithm is correct, and analyse the worst-case complexity of your algorithm.