Augmenting graphs to meet edge-connectivity requirements
SIAM Journal on Discrete Mathematics
Minimal edge-coverings of pairs of sets
Journal of Combinatorial Theory Series B
Design networks with bounded pairwise distance
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Approximating the weight of shallow Steiner trees
Discrete Applied Mathematics
Approximation algorithms for directed Steiner problems
Journal of Algorithms
Polylogarithmic inapproximability
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Hardness of Approximation for Vertex-Connectivity Network Design Problems
SIAM Journal on Computing
Approximating connectivity augmentation problems
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Network design for vertex connectivity
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Tight approximation algorithm for connectivity augmentation problems
Journal of Computer and System Sciences
Algorithms for Single-Source Vertex Connectivity
FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
An almost O(log k)-approximation for k-connected subgraphs
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
A note on Rooted Survivable Networks
Information Processing Letters
Approximating connectivity augmentation problems
ACM Transactions on Algorithms (TALG)
Approximating survivable networks with β-metric costs
Journal of Discrete Algorithms
Approximating Steiner Networks with Node-Weights
SIAM Journal on Computing
Approximating rooted Steiner networks
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Approximating fault-tolerant group-Steiner problems
Theoretical Computer Science
Approximability of 3- and 4-hop bounded disjoint paths problems
IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
Approximating subset k-connectivity problems
WAOA'11 Proceedings of the 9th international conference on Approximation and Online Algorithms
Approximating minimum-cost connectivity problems via uncrossable bifamilies
ACM Transactions on Algorithms (TALG)
Approximating subset k-connectivity problems
Journal of Discrete Algorithms
| Hi-index | 5.23 |
In the Survivable Network Design Problem (SNDP) one seeks to find a minimum cost subgraph that satisfies prescribed node-connectivity requirements. We give a novel approximation ratio preserving reduction from Directed SNDP to Undirected SNDP. Our reduction extends and widely generalizes as well as significantly simplifies the main results of [G. Kortsarz, R. Krauthgamer, J.R. Lee, Hardness of approximation for vertex-connectivity network design problems, SIAM Journal on Computing 33 (3) (2004) 704-720]. Using it, we derive some new hardness of approximation results, as follows. We show that directed and undirected variants of SNDP and of k-Connected Subgraph are equivalent w.r.t. approximation, and that a @r-approximation for Undirected Rooted SNDP implies a @r-approximation for Directed Steiner Tree.