A cost and space efficient method for unbalanced assignment problems

Abstract

In this paper, a new cost and space efficient solution to unbalanced assignment problems is presented. The new solution uses linear space complexity instead of polynomial complexity as used by the Hungarian method. Moreover, its optimal cost is lower than of the Kumar method - an existing linear space complexity solution to unbalanced assignment problems. ©2010 IEEE.