A factor 2 approximation algorithm for the vertex cover P3 problem

Authors:
Jianhua Tu;Wenli Zhou
Affiliations:
School of Science, Beijing University of Chemical Technology, Beijing 100029, China;IBM Research - China, Beijing 100193, China
Venue:
Information Processing Letters
Year:
2011

Citing 4
Cited 2

A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem

SIAM Journal on Discrete Mathematics
Approximating Minimum Subset Feedback Sets in Undirected Graphs with Applications

SIAM Journal on Discrete Mathematics
Approximation algorithms

Approximation algorithms
A primal-dual interpretation of two 2-approximation algorithms for the feedback vertex set problem in undirected graphs

Operations Research Letters

The vertex cover P3 problem in cubic graphs

Information Processing Letters
On the vertex k-path cover

Discrete Applied Mathematics

Quantified Score

Hi-index	0.89

Visualization

Abstract

We consider the vertex coverP"n (VCP"n) problem, that is, the problem of finding a minimum weight set F@?V such that the graph G[V-F] has no P"n, where P"n is a path with n vertices. The problem also has its application background. In this paper, we restrict our attention to the VCP"3 problem and give a 2-approximation algorithm using the technique of layering.