Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2412.05526

Routing-Controlled Spanners

Elena Grigorescu·Nithish Kumar Kumar·Young-San Lin
View original source ↗Read source document ↗Export metadata ↓

Abstract

Designing sparse directed spanners, which are subgraphs that approximately maintain distance constraints, has attracted sustained interest in TCS, especially due to their wide applicability, as well as the difficulty to obtain tight results. However, a significant drawback of the notion of spanners is that it does not capture a natural setting where demand pairs are subject to restrictions beyond a distance constraint. In this paper we initiate the study of **routing-controlled spanners**, where in addition to distance constraints, demand pairs are also subjected to routing constraints, which may require or forbid visiting specific vertices on feasible paths. The goal is to find a minimum-cost routing solution that satisfies the multiple constraints. Moreover, we introduce an even more general notion, which we call **packing-covering spanner**, where each demand pair is subjected to a number of packing and covering constraints, in addition to a distance constraint. Packing-covering spanners capture other natural network connectivity problems such as optimal hopsets and graph spanners for group Steiner distances. To the best of our knowledge, we obtain the first approximation algorithms for the packing-covering spanner problem, and thus for the routing-controlled spanners, under natural assumptions. Our results match the state-of-the-art approximation ratios in special cases of ours, such as Steiner Forests and Directed Spanners. Our results also imply approximation algorithms for optimal hopsets and graph spanners for group Steiner distances in the directed setting, and position packing-covering spanners as a natural abstraction unifying several well-studied problems in directed network design.

Explore related subjects

cs.DS

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Elena Grigorescu, Nithish Kumar Kumar, Young-San Lin. 2024-12-07. Routing-Controlled Spanners. https://arxiv.org/abs/2412.05526

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↗