Anzeige
Erschienen in:
2008 | OriginalPaper | Buchkapitel
Local Maximal Matching and Local 2-Approximation for Vertex Cover in UDGs
(Extended Abstract)
verfasst von : Andreas Wiese, Evangelos Kranakis
Erschienen in: Ad-hoc, Mobile and Wireless Networks
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
We present 1 −
ε
approximation algorithms for the maximum matching problem in location aware unit disc graphs and in growth-bounded graphs. The algorithm for unit disk graph is local in the sense that whether or not an edge is in the matching depends only on other vertices which are at most a constant number of hops away from it. The algorithm for growth-bounded graphs needs at most
$O\left(\log\triangle\log^{*}n\right.+$
$\left.\frac{1}{\epsilon}^{O(1)}\cdot\log^{*}n\right)$
communication rounds during its execution. Using these matching algorithms we can compute vertex covers of the respective graph classes whose size are at most twice the optimal.