An approximation algorithm based on chain implication for constrained minimum vertex covers in bipartite graphs

被引：0
|
作者：
Wang, Jianxin [1 ]
Xu, Xiaoshuang [1 ]
Chen, Jianer [1 ,2 ]
机构：
[1] Cent South Univ, Sch Informat Sci & Engn, Changsha 410083, Peoples R China
[2] Texas A&M Univ, Dept Comp Sci, College Stn, TX 77843 USA
来源：
THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, PROCEEDINGS | 2007年 / 4484卷
基金：
中国国家自然科学基金;
关键词：
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
The constrained minimum vertex cover problem on bipartite graphs (the Min-CVCB problem) is an NP-complete problem. This paper presents a polynomial time approximation algorithm for the problem based on the technique of chain implication. For any given constant epsilon > 0, if an instance of the Min-CVCB problem has a minimum vertex cover of size (k(u), k(l)), our algorithm constructs a vertex cover of size (k(u)(*) , k(l)(*)), satisfying max {k(u)(*)/k(u) , k(l)(*) /k(l)} <= 1 + epsilon.
引用
收藏
页码：760 / +
页数：2
相关论文
共 50 条
  • [1] Approximation Algorithm Based on Chain Implication for Constrained Minimum Vertex Covers in Bipartite Graphs
    Jian-Xin Wang
    Xiao-Shuang Xu
    Jian-Er Chen
    Journal of Computer Science and Technology, 2008, 23 : 763 - 768
  • [2] Approximation algorithm based on chain implication for constrained minimum vertex covers in bipartite graphs
    Wang, Jian-Xin
    Xu, Xiao-Shuang
    Chen, Jian-Er
    JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY, 2008, 23 (05) : 763 - 768
  • [3] Approximation Algorithm Based on Chain Implication for Constrained Minimum Vertex Covers in Bipartite Graphs
    王建新
    许小双
    陈建二
    Journal of Computer Science & Technology, 2008, (05) : 763 - 768
  • [4] Constrained minimum vertex cover in bipartite graphs: complexity and parameterized algorithms
    Chen, H
    Kanj, IA
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2003, 67 (04) : 833 - 847
  • [5] An Approximation Algorithm for Minimum Vertex Cover on General Graphs
    Li, Shaohua
    Wang, Jianxin
    Chen, Jianer
    Wang, Zhijian
    THIRD INTERNATIONAL SYMPOSIUM ON ELECTRONIC COMMERCE AND SECURITY WORKSHOPS (ISECS 2010), 2010, : 249 - 252
  • [6] Mixed-integer vertex covers on bipartite graphs
    Conforti, Michele
    Gerards, Bert
    Zambelli, Giacomo
    INTEGER PROGRAMMING AND COMBINATORIAL OPTIMIZATION, PROCEEDINGS, 2007, 4513 : 324 - +
  • [7] Blowup algebras of ideals of vertex covers of bipartite graphs
    Gitler, I
    Reyes, E
    Villarreal, RH
    Algebraic Structures and Their Representations, 2005, 376 : 273 - 279
  • [8] Parameterized Algorithms for Partial Vertex Covers in Bipartite Graphs
    Mkrtchyan, Vahan
    Petrosyan, Garik
    Subramani, K.
    Wojciechowski, Piotr
    COMBINATORIAL ALGORITHMS, IWOCA 2020, 2020, 12126 : 395 - 408
  • [9] On minimum vertex covers of generalized Petersen graphs
    Behsaz, Babak
    Hatami, Pooya
    Mahmoodian, Ebadollah S.
    AUSTRALASIAN JOURNAL OF COMBINATORICS, 2008, 40 : 253 - 264
  • [10] On Maximal Chain Subgraphs and Covers of Bipartite Graphs
    Calamoneri, Tiziana
    Gastaldello, Mattia
    Mary, Arnaud
    Sagot, Marie-France
    Sinaimeri, Blerina
    Combinatorial Algorithms, 2016, 9843 : 137 - 150
12345