Approximated Distributed Minimum Vertex Cover Algorithms for Bounded Degree Graphs

被引：0
|
作者：
Zhang, Yong [1 ,2 ]
Chin, Francis Y. L. [2 ]
Ting, Hing-Fung [2 ]
机构：
[1] Hebei Univ, Coll Math & Comp Sci, Baoding, Peoples R China
[2] Univ Hong Kong, Dept Comp Sci, Hong Kong, Peoples R China
来源：
COMPUTING AND COMBINATORICS | 2010年 / 6196卷
关键词：
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
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(Delta), where Delta is the maximal degree of G, improving the previous 3-approximation result with the same round complexity O(Delta). For the weighted case, we give a 4-approximation algorithm with round complexity O(Delta).
引用
收藏
页码：100 / +
页数：2
相关论文
共 50 条
12345