Massaging a Linear Programming Solution to Give a 2-Approximation for a Generalization of the Vertex Cover Problem

@inproceedings{Bshouty1998MassagingAL,
  title={Massaging a Linear Programming Solution to Give a 2-Approximation for a Generalization of the Vertex Cover Problem},
  author={Nader H. Bshouty and Lynn Burroughs},
  booktitle={STACS},
  year={1998}
}
Linear programming relaxations have been used extensively in designing approximation algorithms for optimization problems. For vertex cover, linear programming and a thresholding technique gives a 2-approximate solution, rivaling the best known performance ratio. For a generalization of vertex cover we call vc t , in which we seek to cover t edges, this technique may not yield a feasible solution at all. We introduce a new method for massaging a linear programming solution to get a good… CONTINUE READING