Advertisement

BIT Numerical Mathematics

, Volume 19, Issue 3, pp 418–424 | Cite as

A new implementation of an algorithm for the optimal assignment problem: An improved version of Munkres' algorithm

  • Jin Kue Wong
Article

Abstract

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 phrases

Optimal assignment problem worst-case time analysis of algorithms 

CR categories

5.25 5.41 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    J. Edmonds and R. M. Karp,Theoretical improvements in algorithmic efficiency for network flow problems, JACM 19:2 (April 1972), 248–264.CrossRefGoogle Scholar
  2. 2.
    L. R. Ford, Jr. and D. R. Fulkerson,Flows in Networks, Princeton University Press, (1962), 53–55.Google Scholar
  3. 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. 4.
    J. Munkres,Algorithms for the assignment and transportation problems, J. SIAM 5:1 (March 1957), 32–38.Google Scholar
  5. 5.
    R. Silver,An algorithm for the assignment problem, Comm. ACM 3:11, (Nov. 1960), 605–606.CrossRefGoogle Scholar

Copyright information

© BIT Foundations 1979

Authors and Affiliations

  • Jin Kue Wong
    • 1
  1. 1.Department of Systems & Information ScienceVanderbilt UniversityNashvilleU.S.A.

Personalised recommendations