Complexity and algorithms for the connected vertex cover problem in 4-regular graphs

Yuchao Li, Zishen Yang and Wei Wang

Applied Mathematics and Computation, 2017, vol. 301, issue C, 107-114

Abstract: In the connected vertex cover (CVC) problem, we are given a connected graph G and required to find a vertex cover set C with minimum cardinality such that the induced subgraph G[C] is connected. In this paper, we restrict our attention to the CVC problem in 4-regular graphs. We proved that the CVC problem is still NP-hard for 4-regular graphs and gave a lower bound for the problem. Moreover, we proposed two approximation algorithms for CVC problem with approximation ratio 32 and 43+O(1n), respectively.

Keywords: Connected vertex cover problem; Approximation algorithm; 4-regular graph (search for similar items in EconPapers)
Date: 2017
References: View complete reference list from CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300316307305
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:301:y:2017:i:c:p:107-114

DOI: 10.1016/j.amc.2016.12.004

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().