Approximated distributed minimum vertex cover algorithms for bounded degree graphs

Authors:
Yong Zhang;Francis Y. L. Chin;Hing-Fung Ting
Affiliations:
College of Mathematics and Computer Science, Hebei University, China and Department of Computer Science, The University of Hong Kong, Hong Kong;Department of Computer Science, The University of Hong Kong, Hong Kong;Department of Computer Science, The University of Hong Kong, Hong Kong
Venue:
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
Year:
2010

Citing 8
Cited 0

A primal-dual parallel approximation technique applied to weighted set and vertex covers

Journal of Algorithms
The importance of being biased

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
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
Distributed weighted vertex cover via maximal matchings

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

Information Processing Letters
A local 2-approximation algorithm for the vertex cover problem

DISC'09 Proceedings of the 23rd international conference on Distributed computing
A better approximation ratio for the vertex cover problem

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, two distributed algorithms for the minimum vertex cover problem are given. In the unweighted case, we propose a 2.5-approximation algorithm with round complexity O(Δ), where Δ is the maximal degree of G, improving the previous 3-approximation result with the same round complexity O(Δ). For the weighted case, we give a 4-approximation algorithm with round complexity O(Δ).