Video details loaded
HomeMIT 6.006 Introduction to Algorithms, Spring 2020Lecture 17: Dynamic Programming, Part 3: APSP, Parens, Piano

Lecture 17: Dynamic Programming, Part 3: APSP, Parens, Piano

1:03:45

This is the third of four lectures on dynamic programming. This focusses on applying subproblem constraints and expansions to example problems including, Bellman-Ford SSSP, Floyd-Warshall APSP, arithmetic parenthesization, and piano/guitar fingering.

Instructor: Erik Demaine