Sciweavers

Share
SODA
2012
ACM

Approximating rooted Steiner networks

6 years 5 months ago
Approximating rooted Steiner networks
The Directed Steiner Tree (DST) problem is a cornerstone problem in network design. We focus on the generalization of the problem with higher connectivity requirements. The problem with one root and two sinks is APX-hard. The problem with one root and many sinks is as hard to approximate as the directed Steiner forest problem, and the latter is well known to be as hard to approximate as the label cover problem. Utilizing previous techniques (due to others), we strengthen these results and extend them to undirected graphs. Specifically, we give an Ω(k ) hardness bound for the rooted k-connectivity problem in undirected graphs; this addresses a recent open question of Khanna. As a consequence, we also obtain the Ω(k ) hardness of the undirected subset k-connectivity problem. Additionally, we give a result on the integrality ratio of the natural linear programming relaxation of the directed rooted k-connectivity problem.
Joseph Cheriyan, Bundit Laekhanukit, Guyslain Nave
Added 28 Sep 2012
Updated 28 Sep 2012
Type Journal
Year 2012
Where SODA
Authors Joseph Cheriyan, Bundit Laekhanukit, Guyslain Naves, Adrian Vetta
Comments (0)
books