Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2208.14132

On Sparse Hitting Sets: from Fair Vertex Cover to Highway Dimension

Johannes Blum·Yann Disser·Andreas Emil Feldmann·Siddharth Gupta·Anna Zych-Pawlewicz
View original source ↗Read source document ↗Export metadata ↓

Abstract

We consider the Sparse Hitting Set (Sparse-HS) problem, where we are given a set system $(V,\mathcal{F},\mathcal{B})$ with two families $\mathcal{F},\mathcal{B}$ of subsets of $V$. The task is to find a hitting set for $\mathcal{F}$ that minimizes the maximum number of elements in any of the sets of $\mathcal{B}$. Our focus is on determining the complexity of some special cases of Sparse-HS with respect to the sparseness $k$, which is the optimum number of hitting set elements in any set of $\mathcal{B}$. For the Sparse Vertex Cover (Sparse-VC) problem, $V$ is given by the vertex set of a graph, and $\mathcal{F}$ is its edge set. We prove NP-hardness for sparseness $k\geq 2$ and polynomial time solvability for $k=1$. We also provide a polynomial-time $2$-approximation for any $k$. A special case of Sparse-VC is Fair Vertex Cover (Fair-VC), where the family $\mathcal{B}$ is given by vertex neighbourhoods. For this problem we prove NP-hardness for constant $k$ and provide a polynomial-time $(2-\frac{1}{k})$-approximation. This is better than any approximation possible for Sparse-VC or Vertex Cover (under UGC). We then consider two problems derived from Sparse-HS related to the highway dimension, a graph parameter modelling transportation networks. Most algorithms for graphs of low highway dimension compute solutions to the $r$-Shortest Path Cover ($r$-SPC) problem, where $r>0$, $\mathcal{F}$ contains all shortest paths of length between $r$ and $2r$, and $\mathcal{B}$ contains all balls of radius $2r$. There is an XP algorithm that computes solutions to $r$-SPC of sparseness at most $h$ if the input graph has highway dimension $h$, but the existence if an FPT algorithm was open. We prove that $r$-SPC and also the related $r$-Highway Dimension ($r$-HD) problem are both W[1]-hard. Furthermore, we prove that $r$-SPC admits a polynomial-time $O(\log n)$-approximation.

Explore related subjects

cs.DScs.CCcs.DM

Keep this discovery

BibTeXRIS

Johannes Blum, Yann Disser, Andreas Emil Feldmann, Siddharth Gupta, Anna Zych-Pawlewicz. 2022-08-30. On Sparse Hitting Sets: from Fair Vertex Cover to Highway Dimension. https://arxiv.org/abs/2208.14132

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

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↗