A fast matching algorithm for asymptotically optimal distributed channel assignment

Oshri Naparstek, Amir Leshem

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

11 Scopus citations

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.

Original languageAmerican English
Title of host publication2013 18th International Conference on Digital Signal Processing, DSP 2013
DOIs
StatePublished - 2013
Externally publishedYes
Event2013 18th International Conference on Digital Signal Processing, DSP 2013 - Santorini, Greece
Duration: 1 Jul 20133 Jul 2013

Publication series

Name2013 18th International Conference on Digital Signal Processing, DSP 2013

Conference

Conference2013 18th International Conference on Digital Signal Processing, DSP 2013
Country/TerritoryGreece
CitySantorini
Period1/07/133/07/13

Fingerprint

Dive into the research topics of 'A fast matching algorithm for asymptotically optimal distributed channel assignment'. Together they form a unique fingerprint.

Cite this