A fault-containing self-stabilizing ( 3 − 2 Δ + 1 ) -approximation algorithm for vertex cover in anonymous networks

The non-computability of many distributed tasks in anonymous networks is well known. This paper presents a deterministic self-stabilizing algorithm to compute a ( 3 − 2 Δ + 1 ) -approximation of a minimum vertex cover in anonymous networks. The algorithm operates under the distributed unfair schedul...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Theoretical computer science Jg. 412; H. 33; S. 4361 - 4371
Hauptverfasser: Turau, Volker, Hauck, Bernd
Format: Journal Article Tagungsbericht
Sprache:Englisch
Veröffentlicht: Oxford Elsevier B.V 29.07.2011
Elsevier
Schlagworte:
Algorithmics. Computability. Computer arithmetics
Algorithms
Anonymous networks
Applied sciences
Combinatorics
Combinatorics. Ordered structures
Computer science; control theory; systems
Contamination
Exact sciences and technology
Faults
Graph theory
Logic and foundations
Mathematical logic, foundations, set theory
Mathematics
Miscellaneous
Networks
Recovery
Recursion theory
Sciences and techniques of general use
Self-stabilizing algorithms
Tasks
Theoretical computing
Trees
Vertex cover
Self-stabilizing algorithms
Vertex cover
Anonymous networks
Vertex
Approximation
Computer theory
Node
Approximation algorithm
Recovery
Contamination
Computability
Distributed algorithm
Tree
Deterministic algorithms
ISSN:0304-3975, 1879-2294
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:The non-computability of many distributed tasks in anonymous networks is well known. This paper presents a deterministic self-stabilizing algorithm to compute a ( 3 − 2 Δ + 1 ) -approximation of a minimum vertex cover in anonymous networks. The algorithm operates under the distributed unfair scheduler, stabilizes after O ( n + m ) moves respectively O ( Δ ) rounds, and requires O ( log n ) storage per node. Recovery from a single fault is reached within a constant time and the contamination number is O ( Δ ) . For trees the algorithm computes a 2 -approximation of a minimum vertex cover.
Bibliographie:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0304-3975
1879-2294
DOI:10.1016/j.tcs.2010.11.010