An Efficient Heuristic Algorithm for Solving Connected Vertex Cover Problem
Joint Authors
Zhou, Junping
Zhang, Yongfei
Wu, Jun
Zhang, Liming
Zhao, Peng
Yin, Minghao
Source
Mathematical Problems in Engineering
Issue
Vol. 2018, Issue 2018 (31 Dec. 2018), pp.1-10, 10 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2018-09-06
Country of Publication
Egypt
No. of Pages
10
Main Subjects
Abstract EN
The connected vertex cover (CVC) problem, which has many important applications, is a variant of the vertex cover problem, such as wireless network design, routing, and wavelength assignment problem.
A good algorithm for the problem can help us improve engineering efficiency, cost savings, and resources consumption 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.
In the construction phase, to construct a high quality feasible initial solution, we design a greedy function and a restricted candidate list.
In the local search phase, the configuration checking strategy is adopted to decrease the cycling problem.
The experimental results demonstrate that GRASP-CVC is better than other comparison algorithms in terms of effectivity and efficiency.
American Psychological Association (APA)
Zhang, Yongfei& Wu, Jun& Zhang, Liming& Zhao, Peng& Zhou, Junping& Yin, Minghao. 2018. An Efficient Heuristic Algorithm for Solving Connected Vertex Cover Problem. Mathematical Problems in Engineering،Vol. 2018, no. 2018, pp.1-10.
https://search.emarefa.net/detail/BIM-1207221
Modern Language Association (MLA)
Zhang, Yongfei…[et al.]. An Efficient Heuristic Algorithm for Solving Connected Vertex Cover Problem. Mathematical Problems in Engineering No. 2018 (2018), pp.1-10.
https://search.emarefa.net/detail/BIM-1207221
American Medical Association (AMA)
Zhang, Yongfei& Wu, Jun& Zhang, Liming& Zhao, Peng& Zhou, Junping& Yin, Minghao. An Efficient Heuristic Algorithm for Solving Connected Vertex Cover Problem. Mathematical Problems in Engineering. 2018. Vol. 2018, no. 2018, pp.1-10.
https://search.emarefa.net/detail/BIM-1207221
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-1207221