scholarly journals Extension and its price for the connected vertex cover problem

2021 ◽  
Author(s):  
Mehdi Khosravian Ghadikolaei ◽  
Nikolaos Melissinos ◽  
Jérôme Monnot ◽  
Aris Pagourtzis
Keyword(s):  
Vertex Cover ◽  
Vertex Cover Problem ◽  
Connected Vertex Cover ◽  
Cover Problem ◽  
Connected Vertex

scholarly journals Extension and Its Price for the Connected Vertex Cover Problem

2019 ◽  
pp. 315-326
Author(s):  
Mehdi Khosravian Ghadikoalei ◽  
Nikolaos Melissinos ◽  
Jérôme Monnot ◽  
Aris Pagourtzis
Keyword(s):  
Vertex Cover ◽  
Vertex Cover Problem ◽  
Connected Vertex Cover ◽  
Cover Problem ◽  
Connected Vertex

scholarly journals An Efficient Heuristic Algorithm for Solving Connected Vertex Cover Problem

2018 ◽  
Vol 2018 ◽  
pp. 1-10
Author(s):  
Yongfei Zhang ◽  
Jun Wu ◽  
Liming Zhang ◽  
Peng Zhao ◽  
Junping Zhou ◽  
...  
Keyword(s):  
Local Search ◽  
Vertex Cover ◽  
Cost Savings ◽  
Industrial Applications ◽  
Wavelength Assignment ◽  
Vertex Cover Problem ◽  
Connected Vertex Cover ◽  
Cover Problem ◽  
Comparison Algorithms ◽  
Connected Vertex

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.

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

2018 ◽  
Author(s):  
Yongfei Zhang ◽  
Jun Wu ◽  
Liming Zhang ◽  
Peng Zhao ◽  
Junping Zhou ◽  
...  
Keyword(s):  
Local Search ◽  
Vertex Cover ◽  
Cost Savings ◽  
Industrial Applications ◽  
Wavelength Assignment ◽  
Vertex Cover Problem ◽  
Configuration Checking ◽  
Connected Vertex Cover ◽  
Cover Problem ◽  
Connected Vertex

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.

Sign in / Sign up

Export Citation Format

Share Document