Dense Steiner problems: Approximation algorithms and inapproximability

Marek Karpinski; Mateusz Lewandowski; Syed Mohammad Meesum; Matthias Mnich

Home/Archive/arXiv

arXiv · 2004.14102

Dense Steiner problems: Approximation algorithms and inapproximability

Marek Karpinski·Mateusz Lewandowski·Syed Mohammad Meesum·Matthias Mnich

View original source ↗Read source document ↗Export metadata ↓

Abstract

The Steiner Tree problem is a classical problem in combinatorial optimization: the goal is to connect a set $T$ of terminals in a graph $G$ by a tree of minimum size. Karpinski and Zelikovsky (1996) studied the $\delta$-dense version of {\sc Steiner Tree}, where each terminal has at least $\delta |V(G)\setminus T|$ neighbours outside $T$, for a fixed $\delta > 0$. They gave a PTAS for this problem. We study a generalization of pairwise $\delta$-dense {\sc Steiner Forest}, which asks for a minimum-size forest in $G$ in which the nodes in each terminal set $T_1,\dots,T_k$ are connected, and every terminal in $T_i$ has at least $\delta |T_j|$ neighbours in $T_j$, and at least $\delta|S|$ nodes in $S = V(G)\setminus (T_1\cup\dots\cup T_k)$, for each $i, j$ in $\{1,\dots, k\}$ with $i\neq j$. Our first result is a polynomial-time approximation scheme for all $\delta > 1/2$. Then, we show a $(\frac{13}{12}+\varepsilon)$-approximation algorithm for $\delta = 1/2$ and any $\varepsilon > 0$. We also consider the $\delta$-dense Group Steiner Tree problem as defined by Hauptmann and show that the problem is $\mathsf{APX}$-hard.

Explore related subjects

cs.DS

Keep this discovery

BibTeX RIS

Marek Karpinski, Mateusz Lewandowski, Syed Mohammad Meesum, Matthias Mnich. 2020-04-29. Dense Steiner problems: Approximation algorithms and inapproximability. https://arxiv.org/abs/2004.14102

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↗