A simple local 3-approximation algorithm for vertex cover

Authors:
Valentin Polishchuk;Jukka Suomela
Affiliations:
Helsinki Institute for Information Technology HIIT, Helsinki University of Technology and University of Helsinki, PO Box 68, FI-00014 University of Helsinki, Finland;Helsinki Institute for Information Technology HIIT, Helsinki University of Technology and University of Helsinki, PO Box 68, FI-00014 University of Helsinki, Finland
Venue:
Information Processing Letters
Year:
2009

Citing 11
Cited 7

Locality in distributed graph algorithms

SIAM Journal on Computing
Linear programming without the matrix

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
What Can Be Computed Locally?

SIAM Journal on Computing
On the distributed complexity of computing maximal matchings

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
On the Distributed Complexity of Computing Maximal Matchings

SIAM Journal on Discrete Mathematics
Local and global properties in networks of processors (Extended Abstract)

STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
What cannot be computed locally!

Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
The price of being near-sighted

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
What can be approximated locally?: case study: dominating sets in planar graphs

Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
Tight Local Approximation Results for Max-Min Linear Programs

Algorithmic Aspects of Wireless Sensor Networks
Efficient distributed weighted matchings on trees

SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity

A Self-stabilizing Approximation Algorithm for Vertex Cover in Anonymous Networks

SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Fast distributed approximation algorithms for vertex cover and set cover in anonymous networks

Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
A local 2-approximation algorithm for the vertex cover problem

DISC'09 Proceedings of the 23rd international conference on Distributed computing
Distributed algorithms for edge dominating sets

Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Approximated distributed minimum vertex cover algorithms for bounded degree graphs

COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
Analysing local algorithms in location-aware quasi-unit-disk graphs

Discrete Applied Mathematics
Survey of local algorithms

ACM Computing Surveys (CSUR)

Quantified Score

Hi-index	0.89

Visualization

Abstract

We present a local algorithm (constant-time distributed algorithm) for finding a 3-approximate vertex cover in bounded-degree graphs. The algorithm is deterministic, and no auxiliary information besides port numbering is required.