Fast distributed approximations in planar graphs

Andrzej Czygrinow, Michal Hańćkowiak, Wojciech Wawrzyniak

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

78 Scopus citations


We give deterministic distributed algorithms that given δ > 0 find in a planar graph G, (1 ± δ)-approximations of a maximum independent set, a maximum matching, and a minimum dominating set. The algorithms run in O(log* |G|) rounds. In addition, we prove that no faster deterministic approximation is possible and show that if randomization is allowed it is possible to beat the lower bound for deterministic algorithms.

Original languageEnglish (US)
Title of host publicationDistributed Computing - 22nd International Symposium, DISC 2008, Proceedings
Number of pages15
StatePublished - 2008
Event22nd International Symposium on Distributed Computing, DISC 2008 - Arcachon, France
Duration: Sep 22 2008Sep 24 2008

Publication series

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


Other22nd International Symposium on Distributed Computing, DISC 2008

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)


Dive into the research topics of 'Fast distributed approximations in planar graphs'. Together they form a unique fingerprint.

Cite this