Lecture 23: Dynamic Programming
recorded by: Massachusetts Institute of Technology, MIT
published: Oct. 29, 2012, recorded: April 2011, views: 2552
released under terms of: Creative Commons Attribution Non-Commercial Share Alike (CC-BY-NC-SA)
Report a problem or upload filesIf you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
This lecture introduces dynamic programming, and discusses the notions of optimal substructure and overlapping sub-problems.
Topics covered: Dynamic programming, optimal path, overlapping subproblems, weighted edges, specifications, restrictions, efficiency, pseudo-polynomials.
Link this pageWould you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !