Dynamic Programming Approach to the Traveling Salesman Problem

This discussion covers the Traveling Salesman Problem (TSP) with a focus on dynamic programming techniques. It includes an explanation of the formulas used and compares solutions derived from both the brute force method and dynamic programming approaches.

Dynamic Programming Approach to the Traveling Salesman Problem
Jenny's Lectures CS IT
752.9K views • Mar 13, 2019
Dynamic Programming Approach to the Traveling Salesman Problem

About this video

Discussed Traveling Salesman Problem -- Dynamic Programming--explained using Formula.
TSP solved using the Brute Force method and Dynamic Programming approach

Time Complexity using DP approach would be O(2^n * n^2)

See Complete Playlists:

Placement Series: https://www.youtube.com/playlist?list=PLdo5W4Nhv31YvlDpJhvOYbM9Ap8UypgEy

Data Structures and Algorithms: https: https://www.youtube.com/playlist?list=PLdo5W4Nhv31bbKJzrsKfMpo_grxuLl8LU

Dynamic Programming: https://www.youtube.com/playlist?list=PLdo5W4Nhv31aBrJE1WS4MR9LRfbmZrAQu

Operating Systems: //www.youtube.com/playlist?list=PLdo5W4Nhv31a5ucW_S1K3-x6ztBRD-PNa

DBMS: https://www.youtube.com/playlist?list=PLdo5W4Nhv31b33kF46f9aFjoJPOkdlsRc


Connect & Contact Me:

Facebook: https://www.facebook.com/Jennys-Lectures-CSIT-Netjrf-316814368950701/
Quora: https://www.quora.com/profile/Jayanti-Khatri-Lamba
Instagram: https://www.instagram.com/jayantikhatrilamba/

Tags and Topics

Browse our collection to discover more content in these categories.

Video Information

Views

752.9K

Likes

11.9K

Duration

31:33

Published

Mar 13, 2019

User Reviews

4.8
(150)
Rate:

Related Trending Topics

LIVE TRENDS

Related trending topics. Click any trend to explore more videos.

Trending Now