Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2009.10160

On rooted $k$-connectivity problems in quasi-bipartite digraphs

Zeev Nutov
View original source ↗Read source document ↗Export metadata ↓

Abstract

We consider the directed Min-Cost Rooted Subset $k$-Edge-Connection problem: given a digraph $G=(V,E)$ with edge costs, a set $T \subseteq V$ of terminals, a root node $r$, and an integer $k$, find a min-cost subgraph of $G$ that contains $k$ edge disjoint $rt$-paths for all $t \in T$. The case when every edge of positive cost has head in $T$ admits a polynomial time algorithm due to Frank [Discret. Appl. Math. 157(6):1242-1254, 2009], and the case when all positive cost edges are incident to $r$ is equivalent to the $k$-Multicover problem. Chan, Laekhanukit, Wei, and Zhang [APPROX/RANDOM, 63:1-63:20, 2020] gave an LP-based $O(\ln k \ln |T|)$-approximation algorithm for quasi-bipartite instances, when every edge in $G$ has an end (tail or head) in $T \cup \{r\}$. We give a simple combinatorial algorithm with the same ratio for a more general problem of covering an arbitrary $T$-intersecting supermodular set function by a minimum cost edge set, and for the case when only every positive cost edge has an end in $T \cup \{r\}$.

Explore related subjects

cs.DS

Keep this discovery

BibTeXRIS

Zeev Nutov. 2020-09-21. On rooted $k$-connectivity problems in quasi-bipartite digraphs. https://arxiv.org/abs/2009.10160

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↗