An efficient local search framework for the minimum weighted vertex cover problem

2016 ◽  
Vol 372 ◽  
pp. 428-445 ◽  
Author(s):  
Ruizhi Li ◽  
Shuli Hu ◽  
Haochen Zhang ◽  
Minghao Yin
Keyword(s):  
Local Search ◽  
Vertex Cover ◽  
Vertex Cover Problem ◽  
Weighted Vertex ◽  
Cover Problem

NuMWVC: A novel local search for minimum weighted vertex cover problem

2019 ◽  
Vol 71 (9) ◽  
pp. 1498-1509 ◽  
Author(s):  
Ruizhi Li ◽  
Shuli Hu ◽  
Shaowei Cai ◽  
Jian Gao ◽  
Yiyuan Wang ◽  
...  
Keyword(s):  
Local Search ◽  
Vertex Cover ◽  
Vertex Cover Problem ◽  
Weighted Vertex ◽  
Cover Problem

scholarly journals Parameterized Analysis of Multiobjective Evolutionary Algorithms and the Weighted Vertex Cover Problem

2019 ◽  
Vol 27 (4) ◽  
pp. 559-575
Author(s):  
Mojgan Pourhassan ◽  
Feng Shi ◽  
Frank Neumann
Keyword(s):  
Evolutionary Algorithm ◽  
Complexity Analysis ◽  
Minimum Weight ◽  
Vertex Cover ◽  
Optimal Solution ◽  
Population Based ◽  
Mutation Operator ◽  
Vertex Cover Problem ◽  
Weighted Vertex ◽  
Cover Problem

Evolutionary multiobjective optimization for the classical vertex cover problem has been analysed in Kratsch and Neumann ( 2013 ) in the context of parameterized complexity analysis. This article extends the analysis to the weighted vertex cover problem in which integer weights are assigned to the vertices and the goal is to find a vertex cover of minimum weight. Using an alternative mutation operator introduced in Kratsch and Neumann ( 2013 ), we provide a fixed parameter evolutionary algorithm with respect to [Formula: see text], the cost of an optimal solution for the problem. Moreover, we present a multiobjective evolutionary algorithm with standard mutation operator that keeps the population size in a polynomial order by means of a proper diversity mechanism, and therefore, manages to find a 2-approximation in expected polynomial time. We also introduce a population-based evolutionary algorithm which finds a [Formula: see text]-approximation in expected time [Formula: see text].

scholarly journals Crown reductions for the Minimum Weighted Vertex Cover problem

2008 ◽  
Vol 156 (3) ◽  
pp. 292-312 ◽  
Author(s):  
Miroslav Chlebík ◽  
Janka Chlebíková
Keyword(s):  
Vertex Cover ◽  
Vertex Cover Problem ◽  
Weighted Vertex ◽  
Cover Problem

Two Local Search Algorithms for Partition Vertex Cover Problem

2016 ◽  
Vol 13 (1) ◽  
pp. 743-751 ◽  
Author(s):  
Yupeng Zhou ◽  
Haochen Zhang ◽  
Ruizhi Li ◽  
Jianan Wang
Keyword(s):  
Local Search ◽  
Vertex Cover ◽  
Search Algorithms ◽  
Local Search Algorithms ◽  
Vertex Cover Problem ◽  
Cover Problem

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.

Sign in / Sign up

Export Citation Format

Share Document