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

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

dynamic programming, graph algorithms, string processing, and algorithms for computational geometry. We will discuss how to use these techniques for solving real-world problems in C++. Most ...