On the Optimality of a Class of LP-based Algorithms

Amit Kumar , Rajsekar Manokaran , Madhur Tulsiani , Nisheeth K. Vishnoi

Authors on Pith no claims yet

classification 💻 cs.CC

keywords classcoveringlp-basedpackingresultalgorithmalgorithmsassuming

read the original abstract

In this paper we will be concerned with a class of packing and covering problems which includes Vertex Cover and Independent Set. Typically, one can write an LP relaxation and then round the solution. In this paper, we explain why the simple LP-based rounding algorithm for the \\VC problem is optimal assuming the UGC. Complementing Raghavendra's result, our result generalizes to a class of strict, covering/packing type CSPs.

This paper has not been read by Pith yet.

On the Optimality of a Class of LP-based Algorithms

discussion (0)