On Approximating Partial Set Cover and Generalizations

07/09/2019
by   Chandra Chekuri, et al.
0

Partial Set Cover (PSC) is a generalization of the well-studied Set Cover problem (SC). In PSC the input consists of an integer k and a set system (U,S) where U is a finite set, and S ⊆ 2^U is a collection of subsets of U. The goal is to find a subcollection S' ⊆ S of smallest cardinality such that sets in S' cover at least k elements of U; that is |∪_A ∈ S' A| > k. SC is a special case of PSC when k = |U|. In the weighted version each set X ∈ S has a non-negative weight w(X) and the goal is to find a minimum weight subcollection to cover k elements. Approximation algorithms for SC have been adapted to obtain comparable algorithms for PSC in various interesting cases. In recent work Inamdar and Varadarajan, motivated by geometric set systems, obtained a simple and elegant approach to reduce PSC to SC via the natural LP relaxation. They showed that if a deletion-closed family of SC admits a β-approximation via the natural LP relaxation, then one can obtain a 2(β + 1)-approximation for PSC on the same family. In a subsequent paper, they also considered a generalization of PSC that has multiple partial covering constraints which is partly inspired by and generalizes previous work of Bera et al on the Vertex Cover problem. Our main goal in this paper is to demonstrate some useful connections between the results in previous work and submodularity. This allows us to simplify, and in some cases improve their results. We improve the approximation for PSC to (1-1/e)(β + 1). We extend the previous work to the sparse setting.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/13/2017

On Partial Covering For Geometric Set Systems

We study a generalization of the Set Cover problem called the Partial Se...
research
09/18/2018

On the Partition Set Cover Problem

Various O( n) approximations are known for the Set Cover problem, where ...
research
07/30/2018

On Approximating (Sparse) Covering Integer Programs

We consider approximation algorithms for covering integer programs of th...
research
02/22/2019

ℓ_1-sparsity Approximation Bounds for Packing Integer Programs

We consider approximation algorithms for packing integer programs (PIPs)...
research
01/20/2018

A smaller cover for closed unit curves

Forty years ago Schaer and Wetzel showed that a 1/π×1/2π√(π^2-4) rectang...
research
10/15/2020

Selective Classification via One-Sided Prediction

We propose a novel method for selective classification (SC), a problem w...
research
03/22/2023

Polyhedral Aspects of Feedback Vertex Set and Pseudoforest Deletion Set

We consider the feedback vertex set problem in undirected graphs (FVS). ...

Please sign up or login with your details

Forgot password? Click here to reset