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 ...

This course continues our data structures and algorithms ... programming and its use in solving NP-hard (combinatorial optimization) problems. We will cover some examples of what integer linear ...