Distributed approximation algorithms in unit-disk graphs

Andrzej Czygrinow; M. Hańćkowiak

doi:10.1007/11864219_27

Distributed approximation algorithms in unit-disk graphs

Andrzej Czygrinow, M. Hańćkowiak

Mathematical and Statistical Sciences, School of (SoMSS)

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

9 Scopus citations

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 language	English (US)
Title of host publication	Distributed Computing - 20th International Symposium, DISC 2006, Proceedings
Publisher	Springer Verlag
Pages	385-398
Number of pages	14
ISBN (Print)	3540446249, 9783540446248
DOIs	https://doi.org/10.1007/11864219_27
State	Published - 2006
Event	20th International Symposium on Distributed Computing, DISC 2006 - Stockholm, Sweden Duration: Sep 18 2006 → Sep 20 2006

Publication series

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

Other

Other	20th International Symposium on Distributed Computing, DISC 2006
Country/Territory	Sweden
City	Stockholm
Period	9/18/06 → 9/20/06

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/11864219_27

Cite this

Czygrinow, A., & Hańćkowiak, M. (2006). Distributed approximation algorithms in unit-disk graphs. In Distributed Computing - 20th International Symposium, DISC 2006, Proceedings (pp. 385-398). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4167 LNCS). Springer Verlag. https://doi.org/10.1007/11864219_27

Distributed approximation algorithms in unit-disk graphs. / Czygrinow, Andrzej; Hańćkowiak, M.
Distributed Computing - 20th International Symposium, DISC 2006, Proceedings. Springer Verlag, 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 proceeding › Conference contribution

Czygrinow, A & Hańćkowiak, M 2006, Distributed approximation algorithms in unit-disk graphs. in Distributed Computing - 20th International Symposium, DISC 2006, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4167 LNCS, Springer Verlag, pp. 385-398, 20th International Symposium on Distributed Computing, DISC 2006, Stockholm, Sweden, 9/18/06. https://doi.org/10.1007/11864219_27

@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{\'n}{\'c}kowiak",

year = "2006",

doi = "10.1007/11864219_27",

language = "English (US)",

isbn = "3540446249",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "385--398",

booktitle = "Distributed Computing - 20th International Symposium, DISC 2006, Proceedings",

note = "20th International Symposium on Distributed Computing, DISC 2006 ; Conference date: 18-09-2006 Through 20-09-2006",

}

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

U2 - 10.1007/11864219_27

DO - 10.1007/11864219_27

M3 - Conference contribution

AN - SCOPUS:33845232593

SN - 3540446249

SN - 9783540446248

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

SP - 385

EP - 398

BT - Distributed Computing - 20th International Symposium, DISC 2006, Proceedings

PB - Springer Verlag

T2 - 20th International Symposium on Distributed Computing, DISC 2006

Y2 - 18 September 2006 through 20 September 2006

ER -

Distributed approximation algorithms in unit-disk graphs

Abstract

Publication series

Other

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this