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 条

[21] A novel parameterised approximation algorithm for MINIMUM VERTEX COVER
Brankovic, Ljiljana
Fernau, Henning
THEORETICAL COMPUTER SCIENCE, 2013, 511 : 85 - 108
[22] A local search 4/3-approximation algorithm for the minimum 3-path partition problem
Yong Chen
Randy Goebel
Guohui Lin
Longcheng Liu
Bing Su
Weitian Tong
Yao Xu
An Zhang
Journal of Combinatorial Optimization, 2022, 44 : 3595 - 3610
[23] A 2-approximation NC algorithm for connected vertex cover and tree cover
Fujito, T
Doi, T
INFORMATION PROCESSING LETTERS, 2004, 90 (02) : 59 - 63
[24] An approximation of the minimum vertex cover in a graph
Hiroshi Nagamochi
Toshihide Ibaraki
Japan Journal of Industrial and Applied Mathematics, 1999, 16 : 369 - 375
[25] An approximation of the minimum vertex cover in a graph
Nagamochi, H
Ibaraki, T
JAPAN JOURNAL OF INDUSTRIAL AND APPLIED MATHEMATICS, 1999, 16 (03) : 369 - 375
[26] Approximation algorithm for the minimum weight connected κ-subgraph cover problem
Zhang, Yaping
Shi, Yishuo
Zhang, Zhao
THEORETICAL COMPUTER SCIENCE, 2014, 535 : 54 - 58
[27] Approximation algorithm for minimum weight connected-k-subgraph cover
Liu, Pengcheng
Zhang, Zhao
Huang, Xiaohui
THEORETICAL COMPUTER SCIENCE, 2020, 838 (838) : 160 - 167
[28] A simple approximation algorithm for minimum weight partial connected set cover
Yubai Zhang
Yingli Ran
Zhao Zhang
Journal of Combinatorial Optimization, 2017, 34 : 956 - 963
[29] A simple approximation algorithm for minimum weight partial connected set cover
Zhang, Yubai
Ran, Yingli
Zhang, Zhao
JOURNAL OF COMBINATORIAL OPTIMIZATION, 2017, 34 (03) : 956 - 963
[30] Minimum k-path vertex cover
Bresar, Bostjan
Kardos, Frantisek
Katrenic, Jan
Semanisin, Gabriel
DISCRETE APPLIED MATHEMATICS, 2011, 159 (12) : 1189 - 1195

← 1 2 3 4 5 →