Journal
PARALLEL PROCESSING LETTERS
Volume 20, Issue 2, Pages 173-186Publisher
WORLD SCIENTIFIC PUBL CO PTE LTD
DOI: 10.1142/S0129626410000132
Keywords
Self-stabilization; vertex cover; distributed algorithms; anonymous networks
Funding
- German Research Foundation (DFG) [TU221/3-1]
Ask authors/readers for more resources
This paper presents a deterministic self-stabilizing algorithm that approximates a minimum vertex cover in anonymous networks with ratio 2 using the distributed scheduler and the link-register model with composite atomicity. No algorithm with a better approximation ratio can exist. The algorithm stabilizes in O (min {n, triangle(2), triangle log(3) n}) rounds and requires O (triangle) memory per node.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available