Lecture 35: Knapsack Approximation Proofs
In the previous lecture we showed an approximation to the Knapsack algorithm that is fast when v* = max vi is small. So, convert a knapsack problem into one where v* is small by choosing b and converting vi -> ceil(vi/b). We want an answer within (1 + e) of the true value, so b = (e/n) * v*.
This entry was posted on Friday, April 22nd, 2005 at 11:11 am and is tagged with knapsack algorithm, knapsack problem, v max, ceil, approximation, true value, proofs. You can follow any responses to this entry through the RSS 2.0 feed. You can leave a response, or trackback.
Leave a Reply
Please take time to enjoy the archives: May 2005 (1) April 2005 (11) March 2005 (11) February 2005 (15) January 2005 (7)
Fresh, related resources:
- bLecture 35/b: bKnapsack Approximation Proofs/b by COMS 482
bLecture 35/b: bKnapsack Approximation Proofs/b. Posted in Class Notes by Elliott Back on April 22nd, 2005. [Del.icio.us]. In the previous blecture/b we showed an bapproximation/b to the bKnapsack/b algorithm that is fast when v* = max vi is small. b.../b - blecture 35/b: bknapsack approximation proofs/b
in the previous blecture/b we showed an bapproximation/b to the bknapsack/b algorithm that is fast when v* = max vi is small. so, convert a bknapsack/b problem into one where v* is small by choosing b and converting vi -> ceil(vi/b). b.../b