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(Δ). © 2010 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Zhang, Y., Chin, F. Y. L., & Ting, H. F. (2010). Approximated distributed minimum vertex cover algorithms for bounded degree graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6196 LNCS, pp. 100–109). https://doi.org/10.1007/978-3-642-14031-0_13
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
