image University of Washington Computer Science & Engineering
  CSE 421,  Au '11:  Assignment #5, Due: Thursday, November 3, 2011
  CSE Home   About Us    Search    Contact Info 

Problems:

  1. Kleinberg and Tardos, Chapter 6, Problem 2.

  2. Kleinberg and Tardos, Chapter 6, Problem 3.

  3. Kleinberg and Tardos, Chapter 6, Problem 7.

  4. Design and analyze a dyamic programming algorithm for the version of the knapsack problem in which there are unlimited quantities of each of the n types of items.

CSE logo Computer Science & Engineering
University of Washington
Box 352350
Seattle, WA  98195-2350
(206) 543-1695 voice, (206) 543-2969 FAX