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...
Uloženo v:
| Vydáno v: | Theoretical computer science Ročník 412; číslo 33; s. 4361 - 4371 |
|---|---|
| Hlavní autoři: | , |
| Médium: | Journal Article Konferenční příspěvek |
| Jazyk: | angličtina |
| Vydáno: |
Oxford
Elsevier B.V
29.07.2011
Elsevier |
| Témata: | |
| ISSN: | 0304-3975, 1879-2294 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Shrnutí: | 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. |
|---|---|
| Bibliografie: | 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 |