0/1 Knapsack
Capacity-indexed dynamic programming and the direction of one-dimensional updates.
Capacity-indexed dynamic programming and the direction of one-dimensional updates.
A state-first method for problems with reusable subproblem structure.
A small recurrence illustrating repeated subproblems and state compression.
Dynamic programming for all-pairs shortest paths and negative-cycle detection.
Sequence-alignment dynamic programming with length and reconstruction trade-offs.
The recurrence view of shortest paths and a bridge to graph-specific algorithms.