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 Simple238.5K views20:21

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)

Tags and Topics

This video is tagged with the following topics. Click any tag to explore more related content and discover similar videos:

Tags help categorize content and make it easier to find related videos. Browse our collection to discover more content in these categories.

4.3

47 user reviews

Write a Review

0/1000 characters

User Reviews

0 reviews

Be the first to comment...

Video Information

Views
238.5K

Total views since publication

Likes
1.8K

User likes and reactions

Duration
20:21

Video length

Published
Dec 7, 2015

Release date

Quality
hd

Video definition

Captions
Available

Subtitles enabled

Related Trending Topics

LIVE TRENDS

This video may be related to current global trending topics. Click any trend to explore more videos about what's hot right now!

THIS VIDEO IS TRENDING!

This video is currently trending in Spain under the topic 'g'.

Share This Video

SOCIAL SHARE

Share this video with your friends and followers across all major social platforms including X (Twitter), Facebook, Youtube, Pinterest, VKontakte, and Odnoklassniki. Help spread the word about great content!