1;3409;0c Fast Distributed Approximations in Planar Graphs

Fast Distributed Approximations in Planar Graphs

Distributed Computing, 22nd International Symposium, DISC 2008, vol. 5218, 2008
Pages: 78-92DOI: 10.1007/978-3-540-87779-0_6

DISC

bibtex

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.