The Munkres Assignment Algorithm (Hungarian Algorithm)

preview_player
Показать описание
In this video lesson, we will attempt to solve the assignment problem by using the Munkres assignment algorithm, and give insight into the algorithms time complexity.

Music: "Fretless" - Kevin MacLeod
Рекомендации по теме
Комментарии
Автор

life saver! much better than my lecturer

williamli
Автор

The snap thing didn't work for me

vishavjeetsingh
Автор

The details of the heavy-lifting steps of covering zeros with minimum lines and the final assignment based on the zeros are omitted.

SophiaFeng
Автор

Thank you for the video! Time complexity regarding step 3 is a little confusing. Some explanation on how to find the minimum lines required to cover all zeros would be helpful.

stoneshou
Автор

i literally loved everything about this video. i can say this is the first video lesson that made me feel positive and the explanation was really nice. i finally understood.

senak
Автор

*Thanos* My child you will achieve what I could not with that snap

mrfred
Автор

Cool explanation!! Honestly also mesmerized by how you edited the explanation, it feels very snappy and fun to watch

enderesting
Автор

Returning to this second time, very very helpful. Thank you!

eck
Автор

THANK YOU SO MUCH, i needed this for a test i have in 2 days from now, and it covered everything i need to know about this !

ShaharTVS
Автор

That was very well explained, thanks!

ExpertzeroDingley
Автор

Thank you for this video. Finally had that aha moment for this algorithm regarding picking the assignments.

Trails
Автор

Guys make more videos like this. This just saved my time...!!

harshitjain
Автор

This was amazing, when you know that you have to find zeros that are alone in step 3 then this is the perfect video ;)

saschahans
Автор

Really good explanation. Thank you for this video

tridoan
Автор

thank you for the clear explanation brother

baltac
Автор

i see this video only one time and i learn a lot.very nice style to teach nice job ;)

jeenusss
Автор

Question 1: How do you find the least number of lines to cover all zeros in Step 3?
Question 2: What if there are multiple solutions to step 3 (different ways to cover zeros with the same number of lines)? Will they all result in optimal solutions to the assignment problem?

khazza
Автор

Dude, this was awesome. Saved me on my assignment.

shdeath
Автор

Thank you it was very helpful! I used it for reassigning labels for k-means clustering.

nastarankianersi
Автор

Thanks, you just saved me for a test tomorow 😂

werewolf-hbxp