Tight Approximation Guarantees for Concave Coverage Problems

by   Siddharth Barman, et al.

In the 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 a classic result that the greedy algorithm for this problem achieves an optimal approximation ratio of 1-e^-1. In this work we consider a generalization of this problem wherein an element a can contribute by an amount that depends on the number of times it is covered. Given a concave, nondecreasing function φ, we define C^φ(S) := ∑_a ∈ [n]w_aφ(|S|_a), where |S|_a = |{i ∈ S : a ∈ T_i}|. The standard maximum coverage problem corresponds to taking φ(j) = min{j,1}. For any such φ, we provide an efficient algorithm that achieves an approximation ratio equal to the Poisson concavity ratio of φ, defined by α_φ := min_x ∈ℕ^*𝔼[φ(Poi(x))]/φ(𝔼[Poi(x)]). Complementing this approximation guarantee, we establish a matching NP-hardness result when φ grows in a sublinear way. As special cases, we improve the result of [Barman et al., IPCO, 2020] about maximum multi-coverage, that was based on the unique games conjecture, and we recover the result of [Dudycz et al., IJCAI, 2020] on multi-winner approval-based voting for geometrically dominant rules. Our result goes beyond these special cases and we illustrate it with applications to distributed resource allocation problems, welfare maximization problems and approval-based voting for general rules.



There are no comments yet.


page 1

page 2

page 3

page 4


Tight Approximation Bounds for Maximum Multi-Coverage

In the classic maximum coverage problem, we are given subsets T_1, ..., ...

Tight Approximation Algorithms for p-Mean Welfare Under Subadditive Valuations

We develop polynomial-time algorithms for the fair and efficient allocat...

Approximation algorithms for priority Steiner tree problems

In the Priority Steiner Tree (PST) problem, we are given an undirected g...

Maximum n-times Coverage for COVID-19 Vaccine Design

In the maximum n-times coverage problem, we are provided a set of elemen...

Optimization from Structured Samples for Coverage Functions

We revisit the optimization from samples (OPS) model, which studies the ...

Primal-Dual Algorithms for Indivisible Concave Allocation with Bounded Local Curvature

We study a general allocation setting where agent valuations are specifi...

Online Multistage Subset Maximization Problems

Numerous combinatorial optimization problems (knapsack, maximum-weight m...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.