Abstract
This paper presents a deterministic self-stabilizing algorithm that computes a 3-approximation vertex cover in anonymous networks. It reaches a legal state after O(n∈+∈m) moves or 2n∈+∈1 rounds respectively and recovers from a single fault within a constant containment time. The contamination number is . An enhanced version of this algorithm achieves a 2-approximation on trees. © 2009 Springer-Verlag Berlin Heidelberg.
Author supplied keywords
Cite
CITATION STYLE
Turau, V., & Hauck, B. (2009). A self-stabilizing approximation algorithm for vertex cover in anonymous networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5873 LNCS, pp. 341–353). https://doi.org/10.1007/978-3-642-05118-0_24
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
