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.
@kushagragupta6354 Жыл бұрын
that plane crash effect was amazing!!😂😂👍👍
@oggiai Жыл бұрын
glad you liked it!
@andrewhudson37233 жыл бұрын
A great description of a hard problem.
@lorossi11963 жыл бұрын
Jump to 8:48 to see what happens when you don't go the optimal route and the airplane runs out of fuel
@oggiai3 жыл бұрын
LOL>
@daanvandenberg40562 жыл бұрын
I think there might be a few slight mistakes in the OPT
@darrenyeung22342 жыл бұрын
Yea its wrong. It should be OPT >= MST and Approximation
@ZapOKill3 жыл бұрын
and now the trivial part of solving min-weight perfect match
@oggiai3 жыл бұрын
I was thinking of doing the 0-1 Knapsack problem next
@MarcoAurelio-zu7sd6 ай бұрын
Thank you for sharing!
@kMuhammadRayanAli Жыл бұрын
8:50 why 😭😭😭😭
@darbyl387211 ай бұрын
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).
@ashrafyawar10392 жыл бұрын
@Joe James, could you help me out on generalized version of christofies algorithm ?
@christopherlperezcruz15073 жыл бұрын
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?
@dorsamotiallah39983 жыл бұрын
Thank you so much ❤️
@kunalgarg11873 жыл бұрын
Can you solve my problem...i have question related to this
@anuragturkar79273 жыл бұрын
Why the plane crash, I thought it was an Ad.
@oggiai3 жыл бұрын
Oh, just for fun
@srishtiarora64243 жыл бұрын
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.
@randy44432 жыл бұрын
Didn't we violate the rule of not visiting a node more than once?
@oggiai2 жыл бұрын
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.
@amerm.alnajada74423 жыл бұрын
hello I found the exact solution of this problem . How can I send it to win a prize and get the right of possession?