No video :(

TSP Approximation Algorithms | Solving the Traveling Salesman Problem

Oggi AI - Artificial Intelligence Today

Подписаться 77 тыс.

Просмотров 53 тыс.

50% 1

Видео Поделиться Скачать Добавить в

This video explores the Traveling Salesman Problem, and explains two approximation algorithms for finding a solution in polynomial time. The first method explained is a 2-approximation that uses a minimum spanning tree (MST) and depth first search (DFS). The second method is Christofides' algorithm, which combines perfect matching with a minimum spanning tree. TSP is a classic NP-Hard problem.
I recommend you first watch the following videos on MSTs and DFS, which I reference in this video:
► Kruskal's Algorithm: • Kruskals Algorithm for...
► Prim's Algorithm, • Prims Algorithm for Mi...
► Depth First Search, • Depth-First Search Alg...
Some of my other related graph videos:
► Dijkstras Intro • Dijkstras Algorithm fo...
► Dijkstras on Directed Graph • Dijkstras Algorithm Di...
► Bellman-Ford • Bellman-Ford Single-So...
► Bellman-Ford Example • Bellman Ford Algorithm...
► Floyd-Warshall • Floyd Warshall Graph T...
► Floyd-Warshall on Undirected Graph • Floyd Warshall Algorit...
► Breadth First Search • Breadth First Search -...

Опубликовано:

12 авг 2024

Поделиться:

Ссылка:

Скачать:

Готовим ссылку...

Добавить в:

Мой плейлист

Посмотреть позже

Комментарии : 28

@aysearslan2819 3 года назад

nice jumpscare with the plane

@MrFlipflops4 4 года назад

Give this man a raise!! So helpful!

@daanvandenberg4056 3 года назад

I think you're doing great work in making these algorithms widely understandable for a broad class of people. Might use your video's sometime in a course for my students or so.

@andrewhudson3723 3 года назад

A great description of a hard problem.

@MarcoAurelio-zu7sd 4 месяца назад

Thank you for sharing!

@lorossi1196 3 года назад

Jump to 8:48 to see what happens when you don't go the optimal route and the airplane runs out of fuel

@oggiai 3 года назад

LOL>

@ashrafyawar1039 2 года назад

@Joe James, could you help me out on generalized version of christofies algorithm ?

@christopherlperezcruz1507 3 года назад

Doing Hungarian Method on excel. Using row and column reduction then penalty for each 0. When the penalties are equal I end up marking both bc I can't figure how to choose. Will this affect my optimality?

@kushagragupta6354 Год назад

that plane crash effect was amazing!!😂😂👍👍

@oggiai Год назад

glad you liked it!

@daanvandenberg4056 2 года назад

I think there might be a few slight mistakes in the OPT

@darrenyeung2234 2 года назад

Yea its wrong. It should be OPT >= MST and Approximation

@ZapOKill 3 года назад

and now the trivial part of solving min-weight perfect match

@oggiai 3 года назад

I was thinking of doing the 0-1 Knapsack problem next

@kMuhammadRayanAli Год назад

8:50 why 😭😭😭😭

@darbyl3872 9 месяцев назад

What algorithm allows a node to be visited more than once? The one-time restriction does not always give the optimal route (in real life).

@dorsamotiallah3998 3 года назад

Thank you so much ❤️

@kunalgarg1187 3 года назад

Can you solve my problem...i have question related to this

@srishtiarora6424 3 года назад

how can we add edges of M to T? Won't it change the original graph?

@Kuchenklau Год назад

No, as the original graph is a complete graph. Any edges added have already been there in the first place.

@amerm.alnajada7442 3 года назад

hello I found the exact solution of this problem . How can I send it to win a prize and get the right of possession?

@anuragturkar7927 3 года назад

Why the plane crash, I thought it was an Ad.

@oggiai 3 года назад

Oh, just for fun

@randy4443 2 года назад

Didn't we violate the rule of not visiting a node more than once?

@oggiai 2 года назад

No, the goal is to find a circuit that visits each node exactly once. But we may visit each node multiple times to find that circuit.

@chinitatuntun 4 года назад

Thanks for the Traveling Sales PERSON problem! :)

Далее

The Traveling Salesman Problem: When Good Enough Beats Perfect

30:27

The Traveling Salesman Problem: When Good Enough Beats Perfect

Просмотров 265 тыс.

R9. Approximation Algorithms: Traveling Salesman Problem

31:59

R9. Approximation Algorithms: Traveling Salesman Problem

Просмотров 124 тыс.

БОЛОТО В АКВАРИУМЕ ИЗ БУДУЩЕГО - ДЕНЬ 60

09:11

БОЛОТО В АКВАРИУМЕ ИЗ БУДУЩЕГО - ДЕНЬ 60

Просмотров 1,4 млн

Бои в Курской области: ВСУ берут пленных

01:32

Бои в Курской области: ВСУ берут пленных

Просмотров 443 тыс.

Почему отряд "Ахмат" Кадырова не приехал защищать Курскую область от ВСУ? #shorts

00:53

Почему отряд "Ахмат" Кадырова не приехал защищать Курскую область от ВСУ? #shorts

Просмотров 1,1 млн

Тест різних марок авто - бананом!

00:31

Тест різних марок авто - бананом!

Просмотров 158 тыс.

Ford-Fulkerson in 5 minutes

5:15

Ford-Fulkerson in 5 minutes

Просмотров 920 тыс.

Coding Challenge #35.1: Traveling Salesperson

22:55

Coding Challenge #35.1: Traveling Salesperson

Просмотров 287 тыс.

AMD 7900X3D and 7950X3D Core-Parking problems FIXED once and for all!

24:17

AMD 7900X3D and 7950X3D Core-Parking problems FIXED once and for all!

Просмотров 22 тыс.

Traveling Salesman Problem Visualization

2:23

Traveling Salesman Problem Visualization

Просмотров 475 тыс.

7.3 Traveling Salesman Problem - Branch and Bound

24:42

7.3 Traveling Salesman Problem - Branch and Bound

Просмотров 1,7 млн

Kruskals Algorithm for Minimum Spanning Trees

5:25

Kruskals Algorithm for Minimum Spanning Trees

Просмотров 25 тыс.

Network Flows: Max-Flow Min-Cut Theorem (& Ford-Fulkerson Algorithm)

21:56

Network Flows: Max-Flow Min-Cut Theorem (& Ford-Fulkerson Algorithm)

Просмотров 328 тыс.

The Travelling Salesman (1 of 3: Understanding the Problem)

7:07

The Travelling Salesman (1 of 3: Understanding the Problem)

Просмотров 37 тыс.

Traveling Salesman Problem | Dynamic Programming | Graph Theory

20:28

Traveling Salesman Problem | Dynamic Programming | Graph Theory

Просмотров 153 тыс.

БОЛОТО В АКВАРИУМЕ ИЗ БУДУЩЕГО - ДЕНЬ 60

09:11

БОЛОТО В АКВАРИУМЕ ИЗ БУДУЩЕГО - ДЕНЬ 60

Просмотров 1,4 млн