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
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 78
EP - 92
BT - Distributed Computing - 22nd International Symposium, DISC 2008, Proceedings
T2 - 22nd International Symposium on Distributed Computing, DISC 2008
Y2 - 22 September 2008 through 24 September 2008
ER -