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 条
  • [1] Inapproximability of Vertex Cover and Independent Set in Bounded Degree Graphs
    Austrin, Per
    Khot, Subhash
    Safra, Muli
    [J]. PROCEEDINGS OF THE 24TH ANNUAL IEEE CONFERENCE ON COMPUTATIONAL COMPLEXITY, 2009, : 74 - +
  • [2] Hybrid Evolutionary Algorithms on Minimum Vertex Cover for Random Graphs
    Pelikan, Martin
    Kalapala, Rajiv
    Hartmann, Alexander K.
    [J]. GECCO 2007: GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE, VOL 1 AND 2, 2007, : 547 - +
  • [3] Approximated vertex cover for graphs with perfect matchings
    Imamura, T
    Iwama, K
    Tsukiji, T
    [J]. COMPUTING AND COMBINATORICS, PROCEEDINGS, 2004, 3106 : 132 - 142
  • [4] Approximated vertex cover for graphs with perfect matchings
    Imamura, Tomokazu
    Iwama, Kazuo
    Tsukiji, Tatsuie
    [J]. IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2006, E89D (08): : 2405 - 2410
  • [5] Approximation algorithms for the maximum vertex coverage problem on bounded degree graphs
    Zhou, Peiyan
    Jiang, Haitao
    Zhu, Daming
    Zhu, Binhai
    [J]. THEORETICAL COMPUTER SCIENCE, 2021, 888 : 22 - 30
  • [6] Approximation algorithms for the maximum vertex coverage problem on bounded degree graphs
    Zhou, Peiyan
    Jiang, Haitao
    Zhu, Daming
    Zhu, Binhai
    [J]. Theoretical Computer Science, 2021, 888 : 22 - 30
  • [7] Constrained minimum vertex cover in bipartite graphs: complexity and parameterized algorithms
    Chen, H
    Kanj, IA
    [J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2003, 67 (04) : 833 - 847
  • [8] Minimum vertex cover in rectangle graphs
    Bar-Yehuda, Reuven
    Hermelin, Danny
    Rawitz, Dror
    [J]. COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2011, 44 (6-7): : 356 - 364
  • [9] Minimum Vertex Cover in Rectangle Graphs
    Bar-Yehuda, Reuven
    Hermelin, Danny
    Rawitz, Dror
    [J]. ALGORITHMS-ESA 2010, 2010, 6346 : 255 - +
  • [10] Approximating the minimum vertex cover in sublinear time and a connection to distributed algorithms
    Parnas, Michal
    Ron, Dana
    [J]. THEORETICAL COMPUTER SCIENCE, 2007, 381 (1-3) : 183 - 196
12345