Question: Consider the Knapsack problem. We have n items, each with weight aj and value cj (j = 1, , n). All a, and cj are
Consider the Knapsack problem. We have n items, each with weight aj and value cj (j = 1, , n). All a, and cj are positive integers. The question is to find a subset of the items with total weight at most b such that the corresponding profit is at least k (b and k are also integers). Show that Knapsack is NP-complete by a reduction from Subset Sum
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
