Polylogarithmic Approximation Algorithm for k-Connected Directed Steiner Tree on Quasi-Bipartite Graphs

by   Chun-Hsiang Chan, et al.

In the k-Connected Directed Steiner Tree problem (k-DST), we are given a directed graph G=(V, E) with edge (or vertex) costs, a root vertex r, a set of q terminals T, and a connectivity requirement k>0; the goal is to find a minimum-cost subgraph H of G such that H has k internally disjoint paths from the root r to each terminal t . The k-DST problem is a natural generalization of the classical Directed Steiner Tree problem (DST) in the fault-tolerant setting in which the solution subgraph is required to have an r,t-path, for every terminal t, even after removing k-1 edges or vertices. Despite being a classical problem, there are not many positive results on the problem, especially for the case k >= 3. In this paper, we will present an O(log k log q)-approximation algorithm for k-DST when an input graph is quasi-bipartite, i.e., when there is no edge joining two non-terminal vertices. To the best of our knowledge, our algorithm is the only known non-trivial approximation algorithm for k-DST, for k >= 3, that runs in polynomial-time regardless of the structure of the optimal solution. In addition, our algorithm is tight for every constant k, due to the hardness result inherited from the Set Cover problem.


page 1

page 2

page 3

page 4


Almost Tight Approximation Hardness for Single-Source Directed k-Edge-Connectivity

In the k-connected directed Steiner tree problem (k-DST), we are given a...

Tight Approximation for Variants of Directed Steiner Tree via State-Tree Decomposition and Linear Programming Rounding

Directed Steiner Tree (DST) is a central problem in combinatorial optimi...

Survivable Network Design for Group Connectivity in Low-Treewidth Graphs

In the Group Steiner Tree problem (GST), we are given a (vertex or edge)...

Approximation Algorithms for Directed Weighted Spanners

In the pairwise weighted spanner problem, the input consists of an n-ver...

A Constant-Factor Approximation for Quasi-bipartite Directed Steiner Tree on Minor-Free Graphs

We give the first constant-factor approximation algorithm for quasi-bipa...

Survivable Network Design Revisited: Group-Connectivity

In the classical survivable network design problem (SNDP), we are given ...

O(^2k/k)-Approximation Algorithm for Directed Steiner Tree: A Tight Quasi-Polynomial-Time Algorithm

In the Directed Steiner Tree (DST) problem we are given an n-vertex dire...

Please sign up or login with your details

Forgot password? Click here to reset