A factor 2 approximation algorithm for the vertex cover problem
Highlights
► In the article we translate the camera layout problem into the vertex cover problem in graph theory. ► We first proved two important inequalities on the problem to show the main result. ► We designed an approximation algorithm to solve the vertex cover problem. ► We proved the performance factor of the algorithm is no more than 2.
References (9)
- et al.
A local-ratio theorem for approximating the weighted vertex cover problem
J. Algorithms
(1981) - et al.
A primal–dual interpretation of two 2-approximation algorithms for the feedback vertex set problem in undirected graphs
Oper. Res. Lett.
(1998) - et al.
A 2-approximation algorithm for the undirected feedback vertex set problem
SIAM J. Discrete Math.
(1999) - et al.
Graph Theory with Applications
(1976)
Cited by (59)
Approximation algorithm for minimum connected 3-path vertex cover
2020, Discrete Applied MathematicsApproximation algorithm for minimum weight connected-k-subgraph cover
2020, Theoretical Computer ScienceApproximation algorithm for (connected) bounded-degree deletion problem on unit disk graphs
2020, Theoretical Computer ScienceKernels for packing and covering problems
2019, Theoretical Computer ScienceA multi-start iterated greedy algorithm for the minimum weight vertex cover P <inf>3</inf> problem
2019, Applied Mathematics and ComputationCitation Excerpt :In [18], Xiao et al. gave an exact algorithm which can solve the VCP3 problem in O*(1.4646n) time and polynomial space or O*(1.3659n) time and exponential space. In [14,15], Tu et al. gave two 2-approximation algorithms for the MWVCP3 problem using the primal-dual method and the local-ratio method. For parameterized algorithms of the VCP3 probelm, Fellows et al. [6] gave an algorithm with running time 2t · nO(1), where parameter t is the size of the solution sought after.
Approximation algorithms for minimum weight connected 3-path vertex cover
2019, Applied Mathematics and ComputationCitation Excerpt :In [12], a randomized algorithm was given for MinVCP3 achieving expected approximation ratio 23/11. Taking weight into consideration, Tu and Zhou presented 2-approximation algorithms for MinWVCP3 using local ratio method [22] and primal-dual method [23], respectively. In fact, MinWVCP3 is a special case of the node-deletion problem studied in [14] and [16].