Abstract
We will give distributed approximation schemes for the maximum matching problem and the minimum connected dominating set problem in unit-disk graphs. The algorithms are deterministic, run in a poly-logarithmic number of rounds in the message passing model and the approximation error can be made O(1/log k |G|) where |G| is the order of the graph and k is a positive integer. © Springer-Verlag Berlin Heidelberg 2006.
Cite
CITATION STYLE
Czygrinow, A., & Hańćkowiak, M. (2006). Distributed approximation algorithms in unit-disk graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4167 LNCS, pp. 385–398). Springer Verlag. https://doi.org/10.1007/11864219_27
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
