Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1304.7571

Approximating {0,1,2}-Survivable Networks with Minimum Number of Steiner Points

Nachshon Cohen·Zeev Nutov
View original source ↗Read source document ↗Export metadata ↓

Abstract

We consider low connectivity variants of the Survivable Network with Minimum Number of Steiner Points (SN-MSP) problem: given a finite set $R$ of terminals in a metric space (M,d), a subset $B \subseteq R$ of "unstable" terminals, and connectivity requirements {r_{uv}: u,v \in R}, find a minimum size set $S \subseteq M$ of additional points such that the unit-disc graph of $R \cup S$ contains $r_{uv}$ pairwise internally edge-disjoint and $(B \cup S)$-disjoint $uv$-paths for all $u,v \in R$. The case when $r_{uv}=1$ for all $u,v \in R$ is the {\sf Steiner Tree with Minimum Number of Steiner Points} (ST-MSP) problem, and the case $r_{uv} \in \{0,1\}$ is the {\sf Steiner Forest with Minimum Number of Steiner Points} (SF-MSP) problem. Let $\Delta$ be the maximum number of points in a unit ball such that the distance between any two of them is larger than 1. It is known that $\Delta=5$ in $\mathbb{R}^2$ The previous known approximation ratio for {\sf ST-MSP} was $\lfloor (\Delta+1)/2 \rfloor+1+\epsilon$ in an arbitrary normed space \cite{NY}, and $2.5+\epsilon$ in the Euclidean space $\mathbb{R}^2$ \cite{cheng2008relay}. Our approximation ratio for ST-MSP is $1+\ln(\Delta-1)+\epsilon$ in an arbitrary normed space, which in $\mathbb{R}^2$ reduces to $1+\ln 4+\epsilon < 2.3863 +\epsilon$. For SN-MSP with $r_{uv} \in \{0,1,2\}$, we give a simple $\Delta$-approximation algorithm. In particular, for SF-MSP, this improves the previous ratio $2\Delta$.

Explore related subjects

cs.DS

Keep this discovery

BibTeXRIS

Nachshon Cohen, Zeev Nutov. 2013-04-29. Approximating {0,1,2}-Survivable Networks with Minimum Number of Steiner Points. https://arxiv.org/abs/1304.7571

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↗