How do we OPTIMALLY assign drivers to riders? (Hungarian Algorithm) | Bipartite Matchings

[@fergalhennessy775]

criminally underrated channel bro, good work!

[@braedonwatkins967]

this is awesome. I like that you took the time to explain vertex covers and related topics *before* jumping into the Hungarian algorithm.

[@michalsejak]

Just nailed an exam thanks to this and other graph videos, thank you kind sir

[@mehdizahedi2810]

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.

[@davidventzke8051]

Great video! Nice introduction of the dual problems.

[@taylorjweidman]

I love these videos!

[@OptWhiz]

thanks so much for watching!

[@gagapornis1438]

Beautiful, thank you.

[@yinyl]

Wonderful!

[@Tygelin86]

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.

[@justice96912]

Real

[@wChris_]

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

[@OptWhiz]

In TSP or VRP, a vehicle may pick up multiple passengers. Here, we're assigning each vehicle to just one passenger.

[@LucasFerreira-hy4sn]

@@OptWhiz You should make a video about VRP

[@Hydra_cody]

Thanks'