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

Full description

Saved in:

Bibliographic Details
Published in:	Theoretical computer science Vol. 412; no. 33; pp. 4361 - 4371
Main Authors:	Turau, Volker, Hauck, Bernd
Format:	Journal Article Conference Proceeding
Language:	English
Published:	Oxford Elsevier B.V 29.07.2011 Elsevier
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!