Fixed Budget vs. Covering Target: The Partial Set Cover Boundary for Bounded VC-Dimension

Madhumita Kundu; Souvik Saha; Saket Saurabh; Anannya Upasana

Home/Archive/arXiv

arXiv · 2608.03801

Fixed Budget vs. Covering Target: The Partial Set Cover Boundary for Bounded VC-Dimension

Madhumita Kundu·Souvik Saha·Saket Saurabh·Anannya Upasana

View original source ↗Read source document ↗Export metadata ↓

Abstract

Maximum Coverage and Partial Set Cover are fundamental parameterized covering problems. The former fixes a budget $k$ and maximizes coverage; the latter meets a target with as few sets as possible. Badanidiyuru, Kleinberg, and Lee (SoCG 2012) give an EPAS for the former on bounded-VC set systems, while Jain et al. (SODA 2023) show that on $K_{d,d}$-free incidence graphs, $k+1$ sets suffice whenever $k$ sets meet the target. We ask whether this guarantee extends to all bounded-VC set systems. Our first result is negative. Unless FPT = W[1], Partial Set Cover admits no parameterized $(2-\delta)$-approximation even at VC-dimension seven. Under ETH, it has no parameterized approximation scheme there and no $2^{o(d)}$-approximation at VC-dimension $d$. On the positive side, bounded semi-ladder index restores this guarantee. It is stronger than bounded VC-dimension but strictly generalizes the $K_{d,d}$-free setting. For Weighted Partial Set Cover, if $k$ sets cover weight $W$, we find $k+1$ sets covering weight $W$ in $2^{O(\Gamma k\log k)}N$ time, where $\Gamma$ is the downward intersection complexity and $N$ is the input size. The framework supports per-class targets and matroid independence, with applications to partial dominating set and geometric and bounded-size covering. Finally, we give a deterministic FPT reduction from Weighted CC-MaxSAT to a bounded family of Weighted Maximum Coverage instances, preserving incidence structure and approximation schemes with constant-factor accuracy loss. This gives an EPAS at bounded semi-ladder index. We improve the deterministic BKL bounded-VC implementation; combined with our reduction, it yields a $2^{\widetilde{O}(kd/\varepsilon)}N^{O(1)}$-time EPAS for bounded-VC Weighted CC-MaxSAT.

Explore related subjects

cs.DS

Keep this discovery

BibTeX RIS

Madhumita Kundu, Souvik Saha, Saket Saurabh, Anannya Upasana. 2026-08-04. Fixed Budget vs. Covering Target: The Partial Set Cover Boundary for Bounded VC-Dimension. https://arxiv.org/abs/2608.03801

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↗