Re:Knapsack problem
by praptak on Tuesday April 23, 2013 @12:25PM
(#5596099)
This greedy approach is in fact the basis for an approximation algorithm with a guaranteed ratio aproximation. Failure to reach optimum: 110 dollars 55 volume gets chosen over 2*(60 dollars 50 volume), assuming knapsack volume 100.
[ Parent
| on HN ]
There are no comments on this comment yet.