Abstract
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. © 2008 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Czygrinow, A., Hańćkowiak, M., & Wawrzyniak, W. (2008). Fast distributed approximations in planar graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5218 LNCS, pp. 78–92). https://doi.org/10.1007/978-3-540-87779-0_6
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
