Distributed approximation algorithms in unit-disk graphs

  • Authors:
  • A. Czygrinow;M. Hańćkowiak

  • Affiliations:
  • Department of Mathematics and Statistics, Arizona State University, Tempe, AZ;Faculty of Mathematics and Computer Science, Adam Mickiewicz University, Poznań, Poland

  • Venue:
  • DISC'06 Proceedings of the 20th international conference on Distributed Computing
  • Year:
  • 2006

Quantified Score

Hi-index 0.01

Visualization

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/logk|G|) where |G| is the order of the graph and k is a positive integer.