Distributed approximation algorithms in unit-disk graphs

Andrzej Czygrinow, M. Hańćkowiak

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

5 Citations (Scopus)

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

Original languageEnglish (US)
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages385-398
Number of pages14
Volume4167 LNCS
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)03029743
ISSN (Electronic)16113349

Other

Other20th International Symposium on Distributed Computing, DISC 2006
CountrySweden
CityStockholm
Period9/18/069/20/06

Fingerprint

Unit Disk Graph
Connected Dominating Set
Maximum Matching
Message passing
Approximation algorithms
Approximation Error
Matching Problem
Message Passing
Distributed Algorithms
Approximation Scheme
Parallel algorithms
Approximation Algorithms
Logarithmic
Integer
Graph in graph theory
Model

ASJC Scopus subject areas

  • Computer Science(all)
  • Biochemistry, Genetics and Molecular Biology(all)
  • Theoretical Computer Science

Cite this

Czygrinow, A., & Hańćkowiak, M. (2006). Distributed approximation algorithms in unit-disk graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4167 LNCS, pp. 385-398). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4167 LNCS).

Distributed approximation algorithms in unit-disk graphs. / Czygrinow, Andrzej; Hańćkowiak, M.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 4167 LNCS 2006. p. 385-398 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4167 LNCS).

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

Czygrinow, A & Hańćkowiak, M 2006, Distributed approximation algorithms in unit-disk graphs. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 4167 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4167 LNCS, pp. 385-398, 20th International Symposium on Distributed Computing, DISC 2006, Stockholm, Sweden, 9/18/06.
Czygrinow A, Hańćkowiak M. Distributed approximation algorithms in unit-disk graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 4167 LNCS. 2006. p. 385-398. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Czygrinow, Andrzej ; Hańćkowiak, M. / Distributed approximation algorithms in unit-disk graphs. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 4167 LNCS 2006. pp. 385-398 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{eaecd107555349b2a238999946d0b441,
title = "Distributed approximation algorithms in unit-disk graphs",
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/log k |G|) where |G| is the order of the graph and k is a positive integer.",
author = "Andrzej Czygrinow and M. Hańćkowiak",
year = "2006",
language = "English (US)",
isbn = "3540446249",
volume = "4167 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "385--398",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - Distributed approximation algorithms in unit-disk graphs

AU - Czygrinow, Andrzej

AU - Hańćkowiak, M.

PY - 2006

Y1 - 2006

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

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

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

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

M3 - Conference contribution

AN - SCOPUS:33845232593

SN - 3540446249

SN - 9783540446248

VL - 4167 LNCS

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

SP - 385

EP - 398

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

ER -