This preview shows page 1. Sign up to view the full content.
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 nd. Problem 1 Page 1...
View Full Document
- Spring '07
- Systems Engineering