A factor 2 approximation algorithm for the vertex cover P3 problem

https://doi.org/10.1016/j.ipl.2011.04.009Get rights and content

Abstract

We consider the vertex cover Pn (VCPn) problem, that is, the problem of finding a minimum weight set FV such that the graph G[VF] has no Pn, where Pn is a path with n vertices. The problem also has its application background. In this paper, we restrict our attention to the VCP3 problem and give a 2-approximation algorithm using the technique of layering.

Highlights

► In the article we translate the camera layout problem into the vertex cover Pn 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 P3 problem. ► We proved the performance factor of the algorithm is no more than 2.

References (9)

There are more references available in the full text version of this article.

Cited by (59)

  • Kernels for packing and covering problems

    2019, Theoretical Computer Science
  • A multi-start iterated greedy algorithm for the minimum weight vertex cover P <inf>3</inf> problem

    2019, Applied Mathematics and Computation
    Citation 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 Computation
    Citation 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].

View all citing articles on Scopus
View full text