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 条
  • [21] Approximation Algorithms for Minimum Chain Vertex Deletion
    Kumar, Mrinal
    Mishra, Sounaka
    Devi, N. Safina
    Saurabh, Saket
    WALCOM: ALGORITHMS AND COMPUTATION, 2011, 6552 : 21 - +
  • [22] An Approximation Algorithm for the Minimum Vertex Cover Problem
    Chen, Jingrong
    Kou, Lei
    Cui, Xiaochuan
    GREEN INTELLIGENT TRANSPORTATION SYSTEM AND SAFETY, 2016, 138 : 180 - 185
  • [23] Linear-Time Algorithms for Maximum-Weight Induced Matchings and Minimum Chain Covers in Convex Bipartite Graphs
    Boris Klemz
    Günter Rote
    Algorithmica, 2022, 84 : 1064 - 1080
  • [24] A new efficient algorithm for weighted vertex cover in bipartite graphs based on a dual problem
    Zhang Yujiao
    Duan Xia
    Yue Xuerong
    Chen Zhibin
    2018 NINTH INTERNATIONAL CONFERENCE ON INFORMATION TECHNOLOGY IN MEDICINE AND EDUCATION (ITME 2018), 2018, : 20 - 23
  • [25] Linear-Time Algorithms for Maximum-Weight Induced Matchings and Minimum Chain Covers in Convex Bipartite Graphs
    Klemz, Boris
    Rote, Guenter
    ALGORITHMICA, 2022, 84 (04) : 1064 - 1080
  • [26] ON SOME SPECTRAL PROPERTIES OF GRAPHS IN TERMS OF THEIR MAXIMUM MATCHINGS AND MINIMUM VERTEX COVERS
    Buzarbarua, Bipanchy
    Das, Prohelika
    ADVANCES AND APPLICATIONS IN DISCRETE MATHEMATICS, 2022, 34 : 57 - 66
  • [27] A novel parameterised approximation algorithm for MINIMUM VERTEX COVER
    Brankovic, Ljiljana
    Fernau, Henning
    THEORETICAL COMPUTER SCIENCE, 2013, 511 : 85 - 108
  • [28] Unpaired many-to-many vertex-disjoint path covers of a class of bipartite graphs
    Chen, Xie-Bin
    INFORMATION PROCESSING LETTERS, 2010, 110 (06) : 203 - 205
  • [29] An approximation algorithm for the minimum weight vertex-connectivity problem in complete graphs with sharpened triangle inequality
    Ferrante, A
    Parente, M
    THEORETICAL COMPUTER SCIENCE, PROCEEDINGS, 2003, 2841 : 137 - 149
  • [30] An approximation algorithm for the minimum weight vertex-connectivity problem in complete graphs with sharpened triangle inequality
    Ferrante, Alessandro
    Parente, Mimmo
    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2003, 2841 : 137 - 149
12345