Reading Assignment: Finish reading Kleinberg and Tardos Chapter 8
Problems: For all problems on this homework if you are proving NP-completeness, give a full argument that shows that your reduction is correct and runs efficiently and make sure to prove that your problem is in NP also. If you are giving an algorithm, prove that your algorithm is correct and show that it runs efficiently.