Solving the Traveling Salesman Problem with Dynamic Programming: The Held-Karp Algorithm
Explore the implementation of the Held-Karp algorithm to find an optimal tour for the Traveling Salesman Problem using dynamic programming techniques.
Tushar Roy - Coding Made Simple
238.5K views • Dec 7, 2015
About this video
Find tour of traveling salesman problem using dynamic programming.
https://www.facebook.com/tusharroy25
https://github.com/mission-peace/interview/blob/master/src/com/interview/graph/TravelingSalesmanHeldKarp.java
https://github.com/mission-peace/interview/graphs/traffic
Held Karp designed this algorithm.
Time complexity is O(2^n*n*n)
https://www.facebook.com/tusharroy25
https://github.com/mission-peace/interview/blob/master/src/com/interview/graph/TravelingSalesmanHeldKarp.java
https://github.com/mission-peace/interview/graphs/traffic
Held Karp designed this algorithm.
Time complexity is O(2^n*n*n)
Tags and Topics
Browse our collection to discover more content in these categories.
Video Information
Views
238.5K
Likes
1.8K
Duration
20:21
Published
Dec 7, 2015
User Reviews
4.3
(47) Related Trending Topics
LIVE TRENDSRelated trending topics. Click any trend to explore more videos.
Trending Now