On the Optimality of a Class of LP-based Algorithms

2009/12/09 by Kumar, Amit, Manokaran, Rajsekar, Tulsiani, Madhur +1
#Computational Complexity (cs.CC) #FOS: Computer and information sciences

paper · doi:10.48550/arxiv.0912.1776

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.

Related

• Iterative Partial Rounding for Vertex Cover with Hard Capacities
• Faster width-dependent algorithm for mixed packing and covering LPs
• 0/1/all CSPs, Half-Integral A-path Packing, and Linear-Time FPT Algorithms
• No Small Linear Program Approximates Vertex Cover within a Factor 2 - ε
• The Complexity of Distributed Approximation of Packing and Covering Integer Linear Programs