CSE 421 Assignment #8
Autumn 2008

Due: Wednesday, December 3, 2008.

Reading Assignment: 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.

  1. Kleinberg and Tardos, Chapter 8, Problem 5, pages 506-507.

  2. Kleinberg and Tardos, Chapter 8, Problem 14, page 512.

  3. Kleinberg and Tardos, Chapter 8, Problem 20, page 515-516.

  4. Extra credit: Kleinberg and Tardos, Chapter 8, Problem 22, page 517.

  5. Extra credit: Kleinberg and Tardos, Chapter 8, Problem 31, page 520.