We study the incremental knapsack ... incremental knapsack problem, which is the strongest guarantee possible given existing hardness results. In contrast to earlier work, our algorithmic approach ...

Our use of python will get more sophisticated as the course ... We will cover dynamic programming for finding longest common subsequences, Knapsack problem and some interesting dynamic programming ...