This course covers basic algorithm design ... conquer, dynamic programming, and greedy algorithms. It concludes with a brief introduction to intractability (NP-completeness) and using linear ...

This course examines such topics as greedy algorithms, dynamic programming, graph algorithms, string processing, and algorithms for computational geometry. We will discuss how to use these techniques ...

Dynamic programming algorithms are a good place to start understanding ... Bellman especially liked 'dynamic' because “it's impossible to use the word dynamic in a pejorative sense”; he ...