Summary: THE PROBABILISTIC ANALYSIS OF A HEURISTIC FOR THE
C. W. Lai*
School of Computer Science
805 Sherbrooke St. W.
Montreal, Canada, H3A 2K6
We present a heuristic to solve the m by m assignment problem in O(m 2 ) time.
The assignment problem is formulated as a weighted complete bipartite graph
G = (S, T , E) , |S| = |T | = m. For convenience we assume that m is even. The main pro
cedure in the heuristic is to construct a graph G d = (S, T , E d ) which is a subgraph of
G , |E d | = 4dn , n = m
2 , such that we can find a perfect matching in G d with probabil
ity at least 1 - 1