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.
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?
![I.N "HALLUCINATION" | [Stray Kids : SKZ-PLAYER]](http://i.ytimg.com/vi/n5B5q1Hwt_U/mqdefault.jpg)
![Seungmin "그렇게, 천천히, 우리(As we are)" | [Stray Kids : SKZ-PLAYER]](http://i.ytimg.com/vi/kAzmhLHePqU/mqdefault.jpg)
nice jumpscare with the plane
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.
Give this man a raise!! So helpful!
Jump to 8:48 to see what happens when you don't go the optimal route and the airplane runs out of fuel
LOL>
that plane crash effect was amazing!!😂😂👍👍
glad you liked it!
A great description of a hard problem.
I think there might be a few slight mistakes in the OPT
Yea its wrong. It should be OPT >= MST and Approximation
and now the trivial part of solving min-weight perfect match
I was thinking of doing the 0-1 Knapsack problem next
Best video on RUclips!
8:50 why 😭😭😭😭
Thank you for sharing!
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).
@Joe James, could you help me out on generalized version of christofies algorithm ?
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?
Thank you so much ❤️
Can you solve my problem...i have question related to this
how can we add edges of M to T? Won't it change the original graph?
No, as the original graph is a complete graph. Any edges added have already been there in the first place.
Why the plane crash, I thought it was an Ad.
Oh, just for fun
Didn't we violate the rule of not visiting a node more than once?
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.
hello I found the exact solution of this problem . How can I send it to win a prize and get the right of possession?
Thanks for the Traveling Sales PERSON problem! :)