Distributed approximation algorithms for planar graphs

Andrzej Czygrinow, Michal Hańćkowiak, Edyta Szymańska

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

1 Scopus citations

Abstract

In this paper we construct two distributed algorithms for computing approximations of a largest matching and a minimum dominating set in planar graphs on n vertices. The approximation ratio in both cases approaches one with n tending to infinity and the number of synchronous communication rounds is poly-logarithmic in n. Our algorithms are purely deterministic.

Original languageEnglish (US)
Title of host publicationAlgorithms and Complexity - 6th Italian Conference, CIAC 2006, Proceedings
PublisherSpringer Verlag
Pages296-307
Number of pages12
ISBN (Print)354034375X, 9783540343752
DOIs
StatePublished - Jan 1 2006
Event6th Italian Conference on Algorithms and Complexity, CIAC 2006 - Rome, Italy
Duration: May 29 2006May 31 2006

Publication series

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

Other

Other6th Italian Conference on Algorithms and Complexity, CIAC 2006
CountryItaly
CityRome
Period5/29/065/31/06

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Distributed approximation algorithms for planar graphs'. Together they form a unique fingerprint.

Cite this