The Hungarian algorithm, also called the Hungarian method, is a combinatorial optimization algorithm that solves the assignment problem in polynomial time and anticipated later primal-dual methods. It was developed and published in 1955 by Harold Kuhn, who named it for the earlier work of the Hungarian mathematicians Denes Konig and Jeno Egervary on which it was based. In 2006 it was discovered that Carl Gustav Jacobi had solved the same assignment problem in the nineteenth century, in a solution published posthumously in 1890.
Facts
Time Complexity
Time Complexity (category) Connections
Credited To
Source Hungarian Algorithm (Wikipedia)
In Field
Source Hungarian Algorithm (Wikipedia)
Invented By
Source Hungarian Algorithm (Wikipedia)
Sources
1. Hungarian Algorithm (Wikipedia)
Wikipedia infobox: time complexity cubic
cubic
Credited To: Harold W. Kuhn, Lead section
It was developed and published in 1955 by Harold Kuhn
Invented By: Harold W. Kuhn, Lead section
It was developed and published in 1955 by Harold Kuhn
In Field: Algorithms and Complexity Theory, Lead sentence
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.
In Group: Network Flow and Matching Algorithms, Lead section
solves the assignment problem in polynomial time
View the SourceWikidata: Hungarian Algorithm
Wikidata Q281922, class allow-list match (w-wdresolver-0926)View the Source Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.