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...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Theoretical computer science Ročník 412; číslo 33; s. 4361 - 4371
Hlavní autori:	Turau, Volker, Hauck, Bernd
Médium:	Journal Article Konferenčný príspevok..
Jazyk:	English
Vydavateľské údaje:	Oxford Elsevier B.V 29.07.2011 Elsevier
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!