Bellman-Held-Karp Algorithm for TSP 🚗
Explores the dynamic programming approach for solving NP-hard Traveling Salesman Problem efficiently, from Algorithms Illuminated, Part 4.
Tim Roughgarden Lectures
2.7K views • May 13, 2020
About this video
The Bellman-Held-Karp dynamic programming algorithm for the traveling salesman problem.
Accompanies the book Algorithms Illuminated, Part 4: Algorithms for NP-Hard Problems (http://www.algorithmsilluminated.org/)
Full playlist: https://www.youtube.com/playlist?list=PLEGCF-WLh2RK6lq3iSsiU84rWVee3A-hz
Accompanies the book Algorithms Illuminated, Part 4: Algorithms for NP-Hard Problems (http://www.algorithmsilluminated.org/)
Full playlist: https://www.youtube.com/playlist?list=PLEGCF-WLh2RK6lq3iSsiU84rWVee3A-hz
Video Information
Views
2.7K
Likes
28
Duration
15:48
Published
May 13, 2020
User Reviews
4.3
(2) Related Trending Topics
LIVE TRENDSRelated trending topics. Click any trend to explore more videos.
Trending Now