Distributed approximation algorithms in unit-disk graphs

Andrzej Czygrinow, M. Hańćkowiak

Research output: Chapter in Book/Report/Conference proceedingConference contribution

9 Scopus citations


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.

Original languageEnglish (US)
Title of host publicationDistributed Computing - 20th International Symposium, DISC 2006, Proceedings
PublisherSpringer Verlag
Number of pages14
ISBN (Print)3540446249, 9783540446248
StatePublished - 2006
Event20th International Symposium on Distributed Computing, DISC 2006 - Stockholm, Sweden
Duration: Sep 18 2006Sep 20 2006

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4167 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Other20th International Symposium on Distributed Computing, DISC 2006

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Distributed approximation algorithms in unit-disk graphs'. Together they form a unique fingerprint.

Cite this