4min chapter

Lex Fridman Podcast cover image

#111 – Richard Karp: Algorithms and Computational Complexity

Lex Fridman Podcast

CHAPTER

The Hungarian Algorithm to Solve the Assignment Problem

In the assignment problem you have n boys and girls. You are given the desirability of or the cost of matching the i-th boy with the j-th girl for all i and j. The idea of the algorithm is to start with the matrix of non-negative numbers. And keep subtracting from rows or entire columns in such a way that you subtract the same constant from all the elements of that row or column, while maintaining the property that all the elements are non-negative.

00:00

Get the Snipd
podcast app

Unlock the knowledge in podcasts with the podcast player of the future.
App store bannerPlay store banner

AI-powered
podcast player

Listen to all your favourite podcasts with AI-powered features

Discover
highlights

Listen to the best highlights from the podcasts you love and dive into the full episode

Save any
moment

Hear something you like? Tap your headphones to save it with AI-generated key takeaways

Share
& Export

Send highlights to Twitter, WhatsApp or export them to Notion, Readwise & more

AI-powered
podcast player

Listen to all your favourite podcasts with AI-powered features

Discover
highlights

Listen to the best highlights from the podcasts you love and dive into the full episode