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

We have seen examples of divide and conquer algorithms in previous courses ... these problems using memoization. We will cover dynamic programming for finding longest common subsequences, Knapsack ...