A fast matching algorithm for asymptotically optimal distributed channel assignment

The channel assignment problem is a special case of a very well studied combinatorial optimization problem known as the assignment problem. In this paper we introduce an asymptotically optimal fully distributed algorithm for the maximum cardinality matching problem. We show that with high probability, the running time of the algorithm on random bipartite graphs is less than O (N log(N)/log N_p)) . We then show that the proposed algorithm can be used to produce asymptotically optimal solutions for the max sum assignment problem.