On the Optimality of a Class of LP-based Algorithms

Details On the Optimality of a Class of LP-based Algorithms On the Optimality of a Class of LP-based Algorithms

2009-12-09

arxiv.org/abs/0912.1776v1

Computer Science

Computational Complexity

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

On the Optimality of a Class of LP-based Algorithms does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the Optimality of a Class of LP-based Algorithms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the Optimality of a Class of LP-based Algorithms will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-276383