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 条

[41] An Exact Algorithm for Minimum Vertex Cover Problem
Wang, Luzhi
Hu, Shuli
Li, Mingyang
Zhou, Junping
MATHEMATICS, 2019, 7 (07)
[42] Stochastic Minimum Vertex Cover in General Graphs: A 3/2-Approximation
Derakhshan, Mahsa
Durvasula, Naveen
Haghtalab, Nika
PROCEEDINGS OF THE 55TH ANNUAL ACM SYMPOSIUM ON THEORY OF COMPUTING, STOC 2023, 2023, : 242 - 253
[43] Approximation algorithm for weighted weak vertex cover
Yong Zhang
Hong Zhu
Journal of Computer Science and Technology, 2004, 19 : 782 - 786
[44] Approximation algorithm for weighted weak vertex cover
Zhang, Y
Zhu, H
JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY, 2004, 19 (06) : 782 - 786
[45] A New Approximation Algorithm for Vertex Cover Problem
Dahiya, Sonika
2013 INTERNATIONAL CONFERENCE ON MACHINE INTELLIGENCE AND RESEARCH ADVANCEMENT (ICMIRA 2013), 2013, : 472 - 478
[46] Hamiltonian Walks and Hamiltonian-Connected 3-Path Graphs
Byers, Alexis
Hallas, Jamie
Olejniczak, Drake
Zayed, Mohra
Zhang, Ping
Journal of Combinatorial Mathematics and Combinatorial Computing, 2020, 113 : 213 - 231
[47] Approximation algorithms to minimum vertex cover problems on polygons and terrains
Tomás, AP
Bajuelos, AL
Marques, F
COMPUTATIONAL SCIENCE - ICCS 2003, PT I, PROCEEDINGS, 2003, 2657 : 869 - 878
[48] An effective algorithm for minimum weighted vertex cover problem
Balaji, S.
Swaminathan, V.
Kannan, K.
International Journal of Computational and Mathematical Sciences, 2010, 4 (01): : 34 - 38
[49] A Massively Parallel Algorithm for Minimum Weight Vertex Cover
Ghaffari, Mohsen
Jin, Ce
Nilis, Daan
PROCEEDINGS OF THE 32ND ACM SYMPOSIUM ON PARALLELISM IN ALGORITHMS AND ARCHITECTURES (SPAA '20), 2020, : 259 - 268
[50] An effective algorithm for minimum weighted vertex cover problem
Balaji, S.
Swaminathan, V.
Kannan, K.
World Academy of Science, Engineering and Technology, 2010, 43 : 315 - 319

← 1 2 3 4 5 →