A local 2-approximation algorithm for the vertex cover problem

Authors:
Matti Åstrand;Patrik Floréen;Valentin Polishchuk;Joel Rybicki;Jukka Suomela;Jara Uitto
Affiliations:
Helsinki Institute for Information Technology, University of Helsinki, Finland;Helsinki Institute for Information Technology, University of Helsinki, Finland;Helsinki Institute for Information Technology, University of Helsinki, Finland;Helsinki Institute for Information Technology, University of Helsinki, Finland;Helsinki Institute for Information Technology, University of Helsinki, Finland;Helsinki Institute for Information Technology, University of Helsinki, Finland
Venue:
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Year:
2009

Citing 18
Cited 9

Distributed program checking: a paradigm for building self-stabilizing distributed protocols (extended abstract)

SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Locality in distributed graph algorithms

SIAM Journal on Computing
A primal-dual parallel approximation technique applied to weighted set and vertex covers

Journal of Algorithms
A simple LP-free approximation algorithm for the minimum weight vertex cover problem

Information Processing Letters
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
Approximation algorithms

Approximation algorithms
Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties

Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
On the Distributed Complexity of Computing Maximal Matchings

SIAM Journal on Discrete Mathematics
Local computations on static and dynamic graphs

ISTCS '95 Proceedings of the 3rd Israel Symposium on the Theory of Computing Systems (ISTCS'95)
What cannot be computed locally!

Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Some simple distributed algorithms for sparse networks

Distributed Computing
The price of being near-sighted

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Vertex cover might be hard to approximate to within 2-ε

Journal of Computer and System Sciences
Distributed weighted vertex cover via maximal matchings

ACM Transactions on Algorithms (TALG)
A simple local 3-approximation algorithm for vertex cover

Information Processing Letters
An optimal local approximation algorithm for max-min linear programs

Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures

Local Algorithms: Self-stabilization on Speed

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
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
Deterministic dominating set construction in networks with bounded degree

ICDCN'11 Proceedings of the 12th international conference on Distributed computing and networking
Analysing local algorithms in location-aware quasi-unit-disk graphs

Discrete Applied Mathematics
Lower bounds for local approximation

PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Survey of local algorithms

ACM Computing Surveys (CSUR)
Lower bounds for local approximation

Journal of the ACM (JACM)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a distributed 2-approximation algorithm for the minimum vertex cover problem. The algorithm is deterministic, and it runs in (Δ + 1)2 synchronous communication rounds, where Δ is the maximum degree of the graph. For Δ = 3, we give a 2-approximation algorithm also for the weighted version of the problem.