Approximation algorithm for minimum connected 3-path vertex cover

被引：3
|
作者：
Liu, Pengcheng [1 ]
Zhang, Zhao [1 ]
Li, Xianyue [2 ]
Wu, Weili [3 ]
机构：
[1] Zhejiang Normal Univ, Coll Math & Comp Sci, Jinhua 321004, Zhejiang, Peoples R China
[2] Lanzhou Univ, Sch Math & Stat, Lanzhou 730000, Gansu, Peoples R China
[3] Univ Texas Dallas, Dept Comp Sci, Richardson, TX 75080 USA
来源：
DISCRETE APPLIED MATHEMATICS | 2020年 / 287卷
关键词：
Connected k-path vertex cover; Approximation algorithm; DISSOCIATION NUMBER; PTAS; SET;
D O I：
10.1016/j.dam.2020.08.008
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
A vertex subset S of a given graph G = (V, E) is called a connected k-path vertex cover (CVCPk) if every k-path of G contains at least one vertex from S, and the subgraph of G induced by S is connected. This concept has its background in the field of security and supervisory and the computation of a minimum CVCPk is NP-hard. In this paper, we give a (2 alpha + 1/2)-approximation algorithm for MinCVCP(3), where alpha is the performance ratio of an algorithm for MinVCP(3). (C) 2020 Elsevier B.V. All rights reserved.
引用
收藏
页码：77 / 84
页数：8
相关论文
共 50 条
  • [1] Approximation algorithms for minimum weight connected 3-path vertex cover
    Ran, Yingli
    Zhang, Zhao
    Huang, Xiaohui
    Li, Xiaosong
    Du, Ding-Zhu
    APPLIED MATHEMATICS AND COMPUTATION, 2019, 347 : 723 - 733
  • [2] Algorithm for Online 3-Path Vertex Cover
    Yubai Zhang
    Zhao Zhang
    Yishuo Shi
    Xianyue Li
    Theory of Computing Systems, 2020, 64 : 327 - 338
  • [3] Parameterized algorithm for 3-path vertex cover
    Tsur, Dekel
    THEORETICAL COMPUTER SCIENCE, 2019, 783 : 1 - 8
  • [4] Algorithm for Online 3-Path Vertex Cover
    Zhang, Yubai
    Zhang, Zhao
    Shi, Yishuo
    Li, Xianyue
    THEORY OF COMPUTING SYSTEMS, 2020, 64 (02) : 327 - 338
  • [5] A faster FPT algorithm for 3-path vertex cover
    Katrenic, Jan
    INFORMATION PROCESSING LETTERS, 2016, 116 (04) : 273 - 278
  • [6] Approximation Algorithm for the Minimum Connected k-Path Vertex Cover Problem
    Li, Xiaosong
    Zhang, Zhao
    Huang, Xiaohui
    COMBINATORIAL OPTIMIZATION AND APPLICATIONS (COCOA 2014), 2014, 8881 : 764 - 771
  • [7] On computing the minimum 3-path vertex cover and dissociation number of graphs
    Kardos, Frantisek
    Katrenic, Jan
    Schiermeyer, Ingo
    THEORETICAL COMPUTER SCIENCE, 2011, 412 (50) : 7009 - 7017
  • [8] Kernelization of the 3-path vertex cover problem
    Brause, Christoph
    Schiermeyer, Ingo
    DISCRETE MATHEMATICS, 2016, 339 (07) : 1935 - 1939
  • [9] An improved approximation algorithm for the minimum 3-path partition problem
    Yong Chen
    Randy Goebel
    Guohui Lin
    Bing Su
    Yao Xu
    An Zhang
    Journal of Combinatorial Optimization, 2019, 38 : 150 - 164
  • [10] An improved approximation algorithm for the minimum 3-path partition problem
    Chen, Yong
    Goebel, Randy
    Lin, Guohui
    Su, Bing
    Xu, Yao
    Zhang, An
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2019, 38 (01) : 150 - 164
12345