Tight Approximation Bounds for Maximum Multi-Coverage

05/02/2019
by   Siddharth Barman, et al.
0

In the classic maximum coverage problem, we are given subsets T_1, ..., T_m of a universe [n] along with an integer k and the objective is to find a subset S ⊆ [m] of size k that maximizes C(S) := |∪_i ∈ S T_i|. It is well-known that the greedy algorithm for this problem achieves an approximation ratio of (1-e^-1) and there is a matching inapproximability result. We note that in the maximum coverage problem if an element e ∈ [n] is covered by several sets, it is still counted only once. By contrast, if we change the problem and count each element e as many times as it is covered, then we obtain a linear objective function, C^(∞)(S) = ∑_i ∈ S |T_i|, which can be easily maximized under a cardinality constraint. We study the maximum ℓ-multi-coverage problem which naturally interpolates between these two extremes. In this problem, an element can be counted up to ℓ times but no more; hence, we consider maximizing the function C^(ℓ)(S) = ∑_e ∈ [n]{ℓ, |{i ∈ S : e ∈ T_i}| }, subject to the constraint |S| ≤ k. Note that the case of ℓ = 1 corresponds to the standard maximum coverage setting and ℓ = ∞ gives us a linear objective. We develop an efficient approximation algorithm that achieves an approximation ratio of 1 - ℓ^ℓe^-ℓ/ℓ! for the ℓ-multi-coverage problem. In particular, when ℓ = 2, this factor is 1-2e^-2≈ 0.73 and as ℓ grows the approximation ratio behaves as 1 - 1/√(2πℓ). We also prove that this approximation ratio is tight, i.e., establish a matching hardness-of-approximation result, under the Unique Games Conjecture.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/02/2020

Tight Approximation Guarantees for Concave Coverage Problems

In the maximum coverage problem, we are given subsets T_1, …, T_m of a u...
research
01/24/2021

Maximum n-times Coverage for COVID-19 Vaccine Design

In the maximum n-times coverage problem, we are provided a set of elemen...
research
08/12/2023

Parameterized Matroid-Constrained Maximum Coverage

In this paper, we introduce the concept of Density-Balanced Subset in a ...
research
08/09/2018

Generalized budgeted submodular set function maximization

In this paper we consider a generalization of the well-known budgeted ma...
research
07/06/2020

Optimization from Structured Samples for Coverage Functions

We revisit the optimization from samples (OPS) model, which studies the ...
research
06/03/2022

Erdős Matching Conjecture for almost perfect matchings

In 1965 Erdős asked, what is the largest size of a family of k-elements ...
research
07/16/2019

The Complexity of Partial Function Extension for Coverage Functions

Coverage functions are an important subclass of submodular functions, fi...

Please sign up or login with your details

Forgot password? Click here to reset