Preprint Article Version 1 Preserved in Portico This version is not peer-reviewed

# An Efficient Heuristic Algorithm for Solving Connected Vertex Cover Problem in Graph Theory

Version 1 : Received: 25 January 2018 / Approved: 25 January 2018 / Online: 25 January 2018 (12:42:20 CET)

How to cite: Zhang, Y.; Wu, J.; Zhang, L.; Zhao, P.; Zhou, J.; Yin, M. An Efficient Heuristic Algorithm for Solving Connected Vertex Cover Problem in Graph Theory. Preprints 2018, 2018010243 (doi: 10.20944/preprints201801.0243.v1). Zhang, Y.; Wu, J.; Zhang, L.; Zhao, P.; Zhou, J.; Yin, M. An Efficient Heuristic Algorithm for Solving Connected Vertex Cover Problem in Graph Theory. Preprints 2018, 2018010243 (doi: 10.20944/preprints201801.0243.v1).

## Abstract

The connected vertex cover (CVC) problem is a variant of the vertex cover problem, which has many important applications, such as wireless network design, routing and wavelength assignment problem, etc. A good algorithm for the problem can help us improve engineering efficiency, cost savings and resources in industrial applications. In this work, we present an efficient algorithm GRASP-CVC (Greedy Randomized Adaptive Search Procedure for Connected Vertex Cover) for CVC in general graphs. The algorithm has two main phases, i.e., construction phase and local search phase. To construct a high quality feasible initial solution, we design a greedy function and a restricted candidate list in the construction phase. The configuration checking strategy is adopted to decrease the cycling problem in the local search phase. The experimental results demonstrate that GRASP-CVC is competitive with the other competitive algorithm, which validate the effectivity and efficiency of our GRASP-CVC solver.

## Keywords

Heuristic algorithm; connected vertex cover; GRASP

## Subject

MATHEMATICS & COMPUTER SCIENCE, Other

Views 0