The lower bound is established for the expected minimal cost in the random Assignment Problem where the cost matrix entries are drawn independently from the Uniform probability distribution. The expected number of independent zeroes created in the initial assignment of the Hungarian Algorithm is asymptotically equal to .
