@inproceedings{04bf50adf0b44d7aa5538cee60313c10,
title = "A fast matching algorithm for asymptotically optimal distributed channel assignment",
abstract = "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.",
author = "Oshri Naparstek and Amir Leshem",
year = "2013",
doi = "https://doi.org/10.1109/ICDSP.2013.6622738",
language = "الإنجليزيّة",
isbn = "9781467358057",
series = "2013 18th International Conference on Digital Signal Processing, DSP 2013",
booktitle = "2013 18th International Conference on Digital Signal Processing, DSP 2013",
note = "2013 18th International Conference on Digital Signal Processing, DSP 2013 ; Conference date: 01-07-2013 Through 03-07-2013",
}