We will cover dynamic programming for finding longest common subsequences, Knapsack problem and some interesting ... We will look at ways to describe problems and algorithms using some ideas from ...

While various approximation algorithms ... incremental knapsack problem, which is the strongest guarantee possible given existing hardness results. In contrast to earlier work, our algorithmic ...

The unbounded knapsack problem ... I've implemented a few of the usual solutions to this problem using recursion/memoization and dynamic programming but the solutions do not work for some sets ...