Awesome video! You splendidly break down a complex problem into understandable pieces and then aggregate them to get the final result. I would really appreciate it if you could recommend a book chapter or an article tailored for a more mathematically inclined audience.
i aprecieate the effort but this topic is really hard for me. Instead of understand the video i just got sleepy and more depressed as im watching this. My brain is just trying to shut off instead of trying to understand. I think that the reason for this is that how many times i end uo in a situation where to learn some topic there is a preety deep stack of things that i need to learn before i even can learn the topic i wanted. So in some cases as I'm forced to put another thing on the stack i end up learning something and i even don't reamember why i was learning this i dont even remember what is on the bootom of the stack i wanted to learn. And this process never ends.
criminally underrated channel bro, good work!
this is awesome. I like that you took the time to explain vertex covers and related topics *before* jumping into the Hungarian algorithm.
Just nailed an exam thanks to this and other graph videos, thank you kind sir
Awesome video! You splendidly break down a complex problem into understandable pieces and then aggregate them to get the final result. I would really appreciate it if you could recommend a book chapter or an article tailored for a more mathematically inclined audience.
Great video! Nice introduction of the dual problems.
Beautiful, thank you.
I love these videos!
thanks so much for watching!
i aprecieate the effort but this topic is really hard for me. Instead of understand the video i just got sleepy and more depressed as im watching this. My brain is just trying to shut off instead of trying to understand. I think that the reason for this is that how many times i end uo in a situation where to learn some topic there is a preety deep stack of things that i need to learn before i even can learn the topic i wanted. So in some cases as I'm forced to put another thing on the stack i end up learning something and i even don't reamember why i was learning this i dont even remember what is on the bootom of the stack i wanted to learn. And this process never ends.
Real
Wonderful!
How is this actually different from the Travelling Salesman Problem or one of its variants like the Vehicle Routing Problem all of which are NP-hard
In TSP or VRP, a vehicle may pick up multiple passengers. Here, we're assigning each vehicle to just one passenger.
@@OptWhiz You should make a video about VRP
Thanks'