knapsack typically tries to maximize one attribute while minimizing some other (or optimal max for both or similar such conditions)... for this problem, all we need to do is find one subset that adds up to the given number... there's no second criteria to maximize/minimize...
Please correct me if my understanding of knapsack is wrong... On Dec 29 2010, 8:01 am, juver++ <[email protected]> wrote: > Yes, and this subset can be find using DP (which is cimular to 0-1 knapsack > problem). -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
