TY - GEN
T1 - A fast matching algorithm for asymptotically optimal distributed channel assignment
AU - Naparstek, Oshri
AU - Leshem, Amir
PY - 2013
Y1 - 2013
N2 - 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(Np)). We then show that the proposed algorithm can be used to produce asymptotically optimal solutions for the max sum assignment problem.
AB - 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(Np)). We then show that the proposed algorithm can be used to produce asymptotically optimal solutions for the max sum assignment problem.
UR - http://www.scopus.com/inward/record.url?scp=84888864085&partnerID=8YFLogxK
U2 - 10.1109/ICDSP.2013.6622738
DO - 10.1109/ICDSP.2013.6622738
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:84888864085
SN - 9781467358057
T3 - 2013 18th International Conference on Digital Signal Processing, DSP 2013
BT - 2013 18th International Conference on Digital Signal Processing, DSP 2013
T2 - 2013 18th International Conference on Digital Signal Processing, DSP 2013
Y2 - 1 July 2013 through 3 July 2013
ER -