PTAS for minimum weighted connected vertex cover problem with c-local condition in unit disk graphs

2010 ◽  
Vol 22 (4) ◽  
pp. 663-673 ◽  
Author(s):  
Lidan Fan ◽  
Zhao Zhang ◽  
Wei Wang
Keyword(s):  
Unit Disk ◽  
Vertex Cover ◽  
Local Condition ◽  
Unit Disk Graphs ◽  
Vertex Cover Problem ◽  
Connected Vertex Cover ◽  
Cover Problem ◽  
Connected Vertex

PTAS for the minimum k-path connected vertex cover problem in unit disk graphs

2011 ◽  
Vol 56 (2) ◽  
pp. 449-458 ◽  
Author(s):  
Xianliang Liu ◽  
Hongliang Lu ◽  
Wei Wang ◽  
Weili Wu
Keyword(s):  
Unit Disk ◽  
Vertex Cover ◽  
Unit Disk Graphs ◽  
Vertex Cover Problem ◽  
Connected Vertex Cover ◽  
Cover Problem ◽  
Path Connected ◽  
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 A PTAS for the minimum weight connected vertex cover P3 problem on unit disk graphs

2015 ◽  
Vol 571 ◽  
pp. 58-66 ◽  
Author(s):  
Limin Wang ◽  
Xiaoyan Zhang ◽  
Zhao Zhang ◽  
Hajo Broersma
Keyword(s):  
Unit Disk ◽  
Minimum Weight ◽  
Vertex Cover ◽  
Unit Disk Graphs ◽  
Connected Vertex Cover ◽  
Connected Vertex

The connected vertex cover problem in k-regular graphs

2019 ◽  
Vol 38 (2) ◽  
pp. 635-645 ◽  
Author(s):  
Yuchao Li ◽  
Wei Wang ◽  
Zishen Yang
Keyword(s):  
Vertex Cover ◽  
Regular Graphs ◽  
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 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 PTAS for connected vertex cover in unit disk graphs

2009 ◽  
Vol 410 (52) ◽  
pp. 5398-5402 ◽  
Author(s):  
Zhao Zhang ◽  
Xiaofeng Gao ◽  
Weili Wu
Keyword(s):  
Unit Disk ◽  
Vertex Cover ◽  
Unit Disk Graphs ◽  
Connected Vertex Cover ◽  
Connected Vertex
Sign in / Sign up

Export Citation Format

Share Document