Maximum Coverage with Cluster Constraints: An LP-Based Approximation Technique

Guido Schäfer; Bernard G. Zweers

Home/Archive/arXiv

arXiv · 2012.04420

Maximum Coverage with Cluster Constraints: An LP-Based Approximation Technique

Guido Schäfer·Bernard G. Zweers

View original source ↗Read source document ↗Export metadata ↓

Abstract

Packing problems constitute an important class of optimization problems, both because of their high practical relevance and theoretical appeal. However, despite the large number of variants that have been studied in the literature, most packing problems encompass a single tier of capacity restrictions only. For example, in the Multiple Knapsack Problem, we assign items to multiple knapsacks such that their capacities are not exceeded. But what if these knapsacks are partitioned into clusters, each imposing an additional capacity restriction on the knapsacks contained in that cluster? In this paper, we study the Maximum Coverage Problem with Cluster Constraints (MCPC), which generalizes the Maximum Coverage Problem with Knapsack Constraints (MCPK) by incorporating cluster constraints. Our main contribution is a general LP-based technique to derive approximation algorithms for cluster capacitated problems. Our technique allows us to reduce the cluster capacitated problem to the respective original packing problem. By using an LP-based approximation algorithm for the original problem, we can then obtain an effective rounding scheme for the problem, which only loses a small fraction in the approximation guarantee. We apply our technique to derive approximation algorithms for MCPC. To this aim, we develop an LP-based $\frac12(1-\frac1e)$-approximation algorithm for MCPK by adapting the pipage rounding technique. Combined with our reduction technique, we obtain a $\frac13(1-\frac1e)$-approximation algorithm for MCPC. We also derive improved results for a special case of MCPC, the Multiple Knapsack Problem with Cluster Constraints (MKPC). Based on a simple greedy algorithm, our approach yields a $\frac13$-approximation algorithm. By combining our technique with a more sophisticated iterative rounding approach, we obtain a $\frac12$-approximation algorithm for certain special cases of MKPC.

Explore related subjects

cs.DS math.OC

Keep this discovery

BibTeX RIS

Guido Schäfer, Bernard G. Zweers. 2020-12-08. Maximum Coverage with Cluster Constraints: An LP-Based Approximation Technique. https://arxiv.org/abs/2012.04420

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Quasi-Monte Carlo Beyond Hardy-Krause II: $(1 + \varepsilon)n$ Samples Suffice

Numerical integration studies how well one can estimate the integral of a function $f$ over $[0,1)^d$ using $n$ sample points. The two classical methods, Monte Carlo (MC) and quasi-Monte Carlo (QMC), have complementary strengths and weaknesses, and a fundamental question is to design an approach that combines the benefits of both. Recently, building on the transference principle in discrepancy theory, Bansal and Jiang~\cite{BJ25a} gave a randomized QMC method that bridges MC and QMC guarantees using only i.i.d.\ samples. Their method also goes beyond the classical Koksma--Hlawka inequality: it achieves integration error $\widetilde{O}_d(\sigma_{\mathsf{SO}}(f)/n)$, where the smoothed-out variation $\sigma_{\mathsf{SO}}(f)$ can be substantially smaller than the Hardy--Krause variation that governs the classical bound. However, their algorithm requires $n^2$ i.i.d.\ samples as input, and this quadratic blowup is inherent to any method based on the transference principle. In this work, we bypass the quadratic blowup: for any constant $\varepsilon > 0$, we show that $(1+\varepsilon)n$ i.i.d.\ samples suffice to both obtain the beyond-Hardy--Krause guarantee of~\cite{BJ25a}, resolving an open problem posed there, and to produce low-discrepancy point sequences. Our algorithms are variants of the online Haar-thinning method of Dwivedi, Feldheim, Gurel-Gurevich, and Ramdas~\cite{DFG+19}.

cs.DS↗

arXiv2026

A deterministic $(1+\varepsilon)^n$ approximation for the permanent of a nonnegative matrix

For every fixed $0<\varepsilon\le1$, we give a deterministic strongly polynomial algorithm that, given a nonnegative matrix $A\in\mathbb{R}_{\ge0}^{n\times n}$, returns $Q$ satisfying $\operatorname{per} A\le Q\le(1+\varepsilon)^n\operatorname{per} A$.

cs.DS↗

arXiv2026

Single-Exponential Algorithms and a Polynomial Kernel for Strong Connectivity Augmentation

Strong Connectivity Augmentation (SCA) asks whether a directed acyclic graph can be made strongly connected by adding at most $k$ prescribed links whose total weight is within a given budget. Klinkby, Misra, and Saurabh (SODA 2021) gave an $O^*(2^{O(k\log k)})$-time algorithm and asked whether the problem admits a single-exponential parameterized algorithm and a polynomial kernel. We answer both questions affirmatively: SCA can be solved in $O^*(9^k)$ time and admits a polynomial kernel with $O(k^4)$ vertices and $O(k^{16})$ bits. For unweighted SCA, we obtain $O^*(4^k)$ time and a kernel with $O(k^3)$ vertices. Our algorithms are based on a particularly simple reduction to Strongly Connected Spanning Subgraph with two edge costs.

cs.DS↗