COMS 482: unofficial class blog

Lecture 35: Knapsack Approximation Proofs

Posted in Class Notes by Elliott Back on April 22nd, 2005. [Del.icio.us]

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 , , , , , , . You can follow any responses to this entry through the RSS 2.0 feed. You can leave a response, or trackback.

Leave a Reply

Your blog, no spam: the magnitudinous and noble Wordpress Anti-Spam Plugin!

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:

Supplied by Google Blog Search
  • 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). ...