Lecture 18: Shortest Paths II: Bellman-Ford, Linear Programming, Difference Constraints

{'English - US': '/courses/electrical-engineering-and-computer-science/6-046j-introduction-to-algorithms-sma-5503-fall-2005/video-lectures/lecture-18-shortest-paths-ii-bellman-ford-linear-programming-difference-constraints/ocw-6.046-lec18.srt'}

Flash and JavaScript are required for this feature.

Download the video from iTunes U or the Internet Archive.

Topics covered: Shortest Paths II: Bellman-Ford, Linear Programming, Difference Constraints

Instructors: Prof. Erik Demaine, Prof. Charles Leiserson

Related Resources

Lecture Notes (PDF)
Assignments
Exams

Free Downloads

Video


Free Streaming


Subtitle

  • English - US (SRT)