next up previous
Next: Matrix Multiplication Up: CSE 2320: Algorithms and Previous: CSE 2320: Algorithms and

Dynamic Programming



Similar to divide-and-conquer, but avoids duplicate work when subproblems are identical.

(Typically used for optimization problems like the Traveling Salesman Problem).



Copyright © 1998 The University of Texas at Arlington