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

02/26/2022
by   Chao Liao, et al.
0

In the k-connected directed Steiner tree problem (k-DST), we are given an n-vertex directed graph G=(V,E) with edge costs, a connectivity requirement k, a root r∈ V and a set of terminals T⊆ V. The goal is to find a minimum-cost subgraph H⊆ G that has k internally disjoint paths from the root vertex r to every terminal t∈ T. In this paper, we show the approximation hardness of k-DST for various parameters, which thus close some long-standing open problems. - Ω(|T|/log |T|)-approximation hardness, which holds under the standard assumption NP≠ZPP. The inapproximability ratio is tightened to Ω(|T|) under the Strongish Planted Clique Hypothesis [Manurangsi, Rubinstein and Schramm, ITCS 2021]. The latter hardness result matches the approximation ratio of |T| obtained by a trivial approximation algorithm, thus closing the long-standing open problem. - Ω(√(2)^k / k)-approximation hardness for the general case of k-DST under the assumption NP≠ZPP. This is the first hardness result known for survivable network design problems with an inapproximability ratio exponential in k. - Ω((k/L)^L/4)-approximation hardness for k-DST on L-layered graphs for L≤ O(log n). This almost matches the approximation ratio of O(k^L-1· L ·log |T|) achieving in O(n^L)-time due to Laekhanukit [ICALP`16].

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/20/2019

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

In the k-Connected Directed Steiner Tree problem (k-DST), we are given a...
research
12/03/2021

Strong Hardness of Approximation for Tree Transversals

Let H be a fixed graph. The H-Transversal problem, given a graph G, asks...
research
08/05/2023

A logarithmic approximation algorithm for the activation edge multicover problem

In the Activation Edge-Multicover problem we are given a multigraph G=(V...
research
02/28/2018

Survivable Network Design for Group Connectivity in Low-Treewidth Graphs

In the Group Steiner Tree problem (GST), we are given a (vertex or edge)...
research
07/03/2018

A Note on Degree vs Gap of Min-Rep Label Cover and Improved Inapproximability for Connectivity Problems

This note concerns the trade-off between the degree of the constraint gr...
research
11/25/2019

Downgrading to Minimize Connectivity

We study the problem of interdicting a directed graph by deleting nodes ...
research
05/22/2020

Target Location Problem for Multi-commodity Flow

Motivated by scheduling in Geo-distributed data analysis, we propose a t...

Please sign up or login with your details

Forgot password? Click here to reset