Question: Consider the integer knapsack problem. Give a recursive algorithm (call it Find-Optimal-Subset) that finds the optimal subset of items through post-processing, that is, after filling
Consider the integer knapsack problem. Give a recursive algorithm (call it Find-Optimal-Subset) that finds the optimal subset of items through post-processing, that is, after filling in the memorization table to find the maximum total value of the optimal subset of items. (The algorithm we studied in class finds only the maximum total value, not the actual optimal subset of items.) Hint: Trace back through the array M[0..n,0..W] following the optimal structure.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
