Back to Discover
🔢

Hungarian algorithm

math Maturity 11-13

You have many jobs to do. You also have many friends to help. Each friend wants a different amount of pay. How can you pick the best way? You can find the way that costs the least. This helps everyone work well. Can you find the best way to help?

50 words
Up Next
🔢
Assignment problem
Math
→
More to explore

✨ What else?

Related topics you might enjoy

Assignment problem 0% Ford–Fulkerson algorithm 0% Push–relabel maximum flow algorithm 0% Maximum flow problem 0% Dijkstra's algorithm 0% Gale–Shapley algorithm 0%

🔬 Go deeper

More advanced topics to explore

Assignment problem Push–relabel maximum flow algorithm Maximum flow problem Dijkstra's algorithm

🪜 Step back

Simpler topics to build understanding

Ford–Fulkerson algorithm Kruskal's algorithm Generalized Petersen graph BEST theorem
📚 Content adapted from Wikipedia | Readability: FK 10.9 | Vital Level 5