Distributed Approximation Algorithms for Planar Graphs

In this paper we construct two distributed algorithms for computing approximations of a largest matching and a minimum dominating set in planar graphs on n vertices. The approximation ratio in both cases approaches one with n tending to infinity and the number of synchronous communication rounds is poly-logarithmic in n. Our algorithms are purely deterministic.

• Type: Conference
• Year: 2006
• Where: CIAC
• Authors: Andrzej Czygrinow, Michal Hanckowiak, Edyta Szymanska
• Keywords: Algorithms, CIAC 2006, Distributed Algorithms, Minimum Dominating Set, Synchronous Communication Rounds