@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",

}