Live briefing
Everything about Hungarian algorithm
Polynomial-time algorithm for the assignment problem
The Hungarian algorithm or Hungarian method is a combinatorial optimization algorithm that solves the assignment problem in polynomial time and which anticipated later primal–dual methods. It was developed and published in 1955 by Harold Kuhn, who gave it the name "Hungarian method" because the algorithm was largely based on the earlier works of two Hungarian mathematicians, Dénes Kőnig and Jenő Egerváry. However, in 2006 it was discovered that Carl Gustav Jacobi had solved the assignment problem in the 19th century, and the solution had been published posthumously in 1890 in Latin. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Hungarian algorithmA 5-minute orientation
- Skim a recent paper: Distributed Matching-By-Clone Hungarian-Based Algorithm for Task Allocation of Multiagent SystemsInfluential work since 2022
- Pick up a classic book: Rubik's Cubic CompendiumThe most-reprinted book on the subject
- Read the landmark paper: Improving the Hungarian assignment algorithmCited 230 times
- Go sideways: Assignment problemA closely related topic
- Go sideways: Rank-maximal allocationA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🏆 Landmark papers (most cited)
Improving the Hungarian assignment algorithm
Improved image processing-based crop detection using Kalman filtering and the Hungarian algorithm
Pilot Assignment in Cell-Free Massive MIMO Based on the Hungarian Algorithm
Speeding up the hungarian algorithm
Defect-free atomic array formation using the Hungarian matching algorithm
Matching and reconstruction of brachytherapy seeds using the Hungarian algorithm (MARSHAL)
Multi-UAV Objective Assignment Using Hungarian Fusion Genetic Algorithm
A hierarchical clustering algorithm based on the Hungarian method
🆕 Influential since 2022
Distributed Matching-By-Clone Hungarian-Based Algorithm for Task Allocation of Multiagent Systems
Path Planning for Multiple Unmanned Surface Vehicles Using Glasius Bio-Inspired Neural Network With Hungarian Algorithm
Multi-Arm Global Cooperative Coal Gangue Sorting Method Based on Improved Hungarian Algorithm
Improved Hungarian algorithm–based task scheduling optimization strategy for remote sensing big data processing
Vehicle Detection and Tracking with Roadside LiDAR Using Improved ResNet18 and the Hungarian Algorithm
📚 Books worth reading
Rubik's Cubic CompendiumDavid Singmaster · 1987
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Assignment problem The assignment problem is a fundamental combinatorial optimization problem. In its most general form, the problem is as follows: The problem instance has…
- Rank-maximal allocation Rank-maximal (RM) allocation is a rule for fair division of indivisible items. Suppose we have to allocate some items among people. Each person can rank…
- Minimum-cost flow problem The minimum-cost flow problem (MCFP) is an optimization and decision problem to find the cheapest possible way of sending a certain amount of flow through…
- Kőnig's theorem (graph theory) In the mathematical area of graph theory, Kőnig's theorem, proved by Dénes Kőnig (1931), describes an equivalence between the maximum matching problem…
- Dynamic programming Dynamic programming (DP) is both a mathematical optimization method and an algorithmic paradigm. The method was developed by Richard Bellman in the 1950s…
- David Shmoys David Bernard Shmoys (born 1959) is a Professor in the School of Operations Research and Information Engineering and the Department of Computer Science…
- Approximate string matching In computer science, approximate string matching (often colloquially referred to as fuzzy string searching) is the technique of finding strings that match…
- Flow network In graph theory, a flow network or a transportation network is a directed graph where each edge has a capacity and each edge receives a flow. The amount…