Learn more about the Dynamic Programming, Greedy Algorithms course here including a course overview, cost information, related jobs and more.

It covers basic algorithm design techniques such as divide and conquer, dynamic programming, and greedy algorithms. It concludes with a brief introduction to intractability (NP-completeness) .

Sequence alignment methods often use something called a 'dynamic programming' algorithm. What is dynamic programming and how does it work?

This article presents a dynamic programming algorithm for scheduling, on a single machine, production of multiple items with time-varying deterministic demands. We formulate the scheduling problem ...

We propose a dynamic programming algorithm for the one-dimensional Fused Lasso Signal Approximator (FLSA). The proposed algorithm has a linear running time in the worst case. A similar approach is ...