lab6 - 1.2 Problem CLRS 16-1(a(c and(d(Making change Extra...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
IE170 Lab #5 Udom Janjarassuk IE 170 – Lab #6: Dynamic Programming + Greedy Algorithms Due Date: February 26, 2007. 11:10AM. Recall from Lab 5 that you are to do CLRS Problem 15-6. (The checkerboard problem) 1 Problem Set 1.1 Problem CLRS 16.2-1 (Show that fractional knapsack has greedy choice property)
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: 1.2 Problem CLRS 16-1 (a), (c), and (d) (Making change) Extra Credit 1.3 Problem Give an instance of the knapsack problem in which the optimal objective values of the 0-1 knapsack problem and the fractional knapsack problem differ by the largest ratio you can find. Problem 1 Page 1...
View Full Document

This note was uploaded on 08/06/2008 for the course IE 170 taught by Professor Ralphs during the Spring '07 term at Lehigh University .

Ask a homework question - tutors are online