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
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
Tight approximation algorithm for connectivity augmentation problems
Journal of Computer and System Sciences
Approximating Minimum-Power k-Connectivity
ADHOC-NOW '08 Proceedings of the 7th international conference on Ad-hoc, Mobile and Wireless Networks
Approximating Node-Connectivity Augmentation Problems
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
| Hi-index | 0.00 |
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 SNDPto Undirected SNDP. Our reduction extends and widely generalizes as well as significantly simplifies the main results of [6]. Using it, we derive some new hardness of approximation results, as follows. We show that directed and undirected variants of SNDPand of k-Connected Subgraphare equivalent w.r.t. approximation, and that a ρ-approximation for Undirected Rooted SNDPimplies a ρ-approximation for Directed Steiner Tree.