Definition: Solve the assignment problem in polynomial time by marking and unmarking entries and covering and uncovering rows and columns.
Also known as Hungarian algorithm.
James Munkres, 1957.
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified 5 May 2010.
HTML page formatted Tue Dec 6 16:16:32 2011.
Cite this as:
Paul E. Black, "Munkres' assignment algorithm", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed., U.S. National Institute of Standards and Technology. 5 May 2010. (accessed TODAY) Available from: http://www.nist.gov/dads/HTML/munkresAssignment.html