Lagrangian relaxation has been used extensively in the design of approximation algorithms. This paper studies its strengths and limitations when applied to Partial Cover. We show that for Partial Cover in general no algorithm that uses Lagrangian relaxation and a Lagrangian Multiplier Preserving (LMP) α-approximation as a black box can yield an approximation factor better than 4 3 α. This matches the upper bound given by Könemann et al. (ESA 2006, pages 468-479). Faced with this limitation we study a specific, yet broad class of covering problems: Partial Totally Balanced Cover. By carefully analyzing the inner workings of the LMP algorithm we are able to give an almost tight characterization of the integrality gap of the standard linear relaxation of the problem. As a consequence we obtain improved approximations for the Partial version of Multicut and Path Hitting on Trees, Rectangle Stabbing, and Set Cover with ρ-Blocks. 2000 ACM Subject Classification: G.2.1.
Recently, Mestre REF has shown that in general no algorithm that uses a Lagrangian multiplier preserving α-approximation algorithm as a black box can yield an approximation factor better than
LAGRANGIAN RELAXATION AND PARTIAL COVER
ArXiv
ArXiv
Mathematics Computer Science