Fast distributed approximations in planar graphs

Andrzej Czygrinow, Michal Hańćkowiak, Wojciech Wawrzyniak

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

53 Citations (Scopus)

Abstract

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 publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages78-92
Number of pages15
Volume5218 LNCS
DOIs
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)03029743
ISSN (Electronic)16113349

Other

Other22nd International Symposium on Distributed Computing, DISC 2008
CountryFrance
CityArcachon
Period9/22/089/24/08

Fingerprint

Deterministic Algorithm
Planar graph
Maximum Independent Set
Maximum Matching
Beat
Dominating Set
Approximation
Distributed Algorithms
Randomisation
Parallel algorithms
Lower bound

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Czygrinow, A., Hańćkowiak, M., & Wawrzyniak, W. (2008). Fast distributed approximations in planar graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5218 LNCS, pp. 78-92). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5218 LNCS). https://doi.org/10.1007/978-3-540-87779-0_6

Fast distributed approximations in planar graphs. / Czygrinow, Andrzej; Hańćkowiak, Michal; Wawrzyniak, Wojciech.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 5218 LNCS 2008. p. 78-92 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5218 LNCS).

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

Czygrinow, A, Hańćkowiak, M & Wawrzyniak, W 2008, Fast distributed approximations in planar graphs. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 5218 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 5218 LNCS, pp. 78-92, 22nd International Symposium on Distributed Computing, DISC 2008, Arcachon, France, 9/22/08. https://doi.org/10.1007/978-3-540-87779-0_6
Czygrinow A, Hańćkowiak M, Wawrzyniak W. Fast distributed approximations in planar graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 5218 LNCS. 2008. p. 78-92. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-540-87779-0_6
Czygrinow, Andrzej ; Hańćkowiak, Michal ; Wawrzyniak, Wojciech. / Fast distributed approximations in planar graphs. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 5218 LNCS 2008. pp. 78-92 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{e51914d10287404bb7da8fda41b1bdef,
title = "Fast distributed approximations in planar graphs",
abstract = "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.",
author = "Andrzej Czygrinow and Michal Hańćkowiak and Wojciech Wawrzyniak",
year = "2008",
doi = "10.1007/978-3-540-87779-0_6",
language = "English (US)",
isbn = "3540877789",
volume = "5218 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "78--92",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - Fast distributed approximations in planar graphs

AU - Czygrinow, Andrzej

AU - Hańćkowiak, Michal

AU - Wawrzyniak, Wojciech

PY - 2008

Y1 - 2008

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=56449104037&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=56449104037&partnerID=8YFLogxK

U2 - 10.1007/978-3-540-87779-0_6

DO - 10.1007/978-3-540-87779-0_6

M3 - Conference contribution

AN - SCOPUS:56449104037

SN - 3540877789

SN - 9783540877783

VL - 5218 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 78

EP - 92

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ER -