A Self-stabilizing Approximation Algorithm for Vertex Cover in Anonymous Networks

Authors:
Volker Turau;Bernd Hauck
Affiliations:
Institute of Telematics, Hamburg University of Technology, Hamburg D-21073;Institute of Telematics, Hamburg University of Technology, Hamburg D-21073
Venue:
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Year:
2009

Citing 7
Cited 0

On the distributed complexity of computing maximal matchings

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Self-stabilization

Self-stabilization
Local and global properties in networks of processors (Extended Abstract)

STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Distributed weighted vertex cover via maximal matchings

ACM Transactions on Algorithms (TALG)
On hard instances of approximate vertex cover

ACM Transactions on Algorithms (TALG)
A simple local 3-approximation algorithm for vertex cover

Information Processing Letters
Approximation of self-stabilizing vertex cover less than 2

SSS'05 Proceedings of the 7th international conference on Self-Stabilizing Systems

Quantified Score

Hi-index	0.00

Visualization

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 $2{\it \Delta} + 1$. An enhanced version of this algorithm achieves a 2-approximation on trees.