lecture 18: PTASs and KNAPSACK
November 10th, 2008A PTAS is a scheme to get an arbitrarily good approximation for an NP-complete problem. Given an input parameter 
, the goal is to find a 
-approximation that runs in time polynomial in n.
It’s often the case that such algorithms can be generated by designing an expensive dynamic program, and then adapting it. We demonstrate this idea with the KNAPSACK problem.
Entries