A new implementation of an algorithm for the optimal assignment problem: An improved version of Munkres' algorithm
- 103 Downloads
Existing implementations of Munkres' algorithm for the optimal assignment problem are shown to requireO(n4) time in the worstn×n case. A new implementation is presented which runs in worst-case timeO(n3) and compares favorably in performance with the algorithm of Edmonds and Karp for this problem.
Keywords and phrasesOptimal assignment problem worst-case time analysis of algorithms
CR categories5.25 5.41
Unable to display preview. Download preview PDF.
- 2.L. R. Ford, Jr. and D. R. Fulkerson,Flows in Networks, Princeton University Press, (1962), 53–55.Google Scholar
- 3.L. R. Kerr,The effect of algebraic structure on the computational complexity of matrix multiplication, (Ph.D. thesis), Cornell Univ., June 1970.Google Scholar
- 4.J. Munkres,Algorithms for the assignment and transportation problems, J. SIAM 5:1 (March 1957), 32–38.Google Scholar