A note on Rooted Survivable Networks
Information Processing Letters
Tree embeddings for two-edge-connected network design
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Approximating survivable networks with minimum number of Steiner points
WAOA'10 Proceedings of the 8th international conference on Approximation and online algorithms
Approximating survivable networks with β-metric costs
Journal of Discrete Algorithms
Buy-at-Bulk Network Design with Protection
Mathematics of Operations Research
Approximability of capacitated network design
IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization
An improved approximation algorithm for minimum-cost subset k-connectivity
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
A note on labeling schemes for graph connectivity
Information Processing Letters
Black-box reductions for cost-sharing mechanism design
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Approximating fault-tolerant group-Steiner problems
Theoretical Computer Science
Prize-Collecting steiner network 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
Degree-Constrained node-connectivity
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Simpler analysis of LP extreme points for traveling salesman and survivable network design problems
Operations Research Letters
Node-weighted network design in planar and minor-closed families of graphs
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Approximating minimum-cost connectivity problems via uncrossable bifamilies
ACM Transactions on Algorithms (TALG)
Prize-collecting steiner network problems
ACM Transactions on Algorithms (TALG)
Approximating subset k-connectivity problems
Journal of Discrete Algorithms
MMM: multi-channel TDMA with MPR capabilities for MANETs
Wireless Networks
Hi-index | 0.00 |
In the Survivable Network Design problem (SNDP), we are given an undirected graph $G(V, E)$ with costs on edges, along with a connectivity requirement $r(u, v)$ for each pair $u, v$ of vertices. The goal is to find a minimum-cost subset $E^*$ of edges, that satisfies the given set of pairwise connectivity requirements. In the edge-connectivity version we need to ensure that there are $r(u, v)$ edge-disjoint paths for every pair $u, v$ of vertices, while in the vertex-connectivity version the paths are required to be vertex-disjoint. The edge-connectivity version of SNDP is known to have a 2-approximation. However, no non-trivial approximation algorithm has been known so far for the vertex version of SNDP, except for special cases of the problem. We present an extremely simple algorithm to achieve an $O(k^3 \log |T|)$-approximation for this problem, where $k$ denotes the maximum connectivity requirement, and $T$ is the set of vertices that participate in one or more pairs with non-zero connectivity requirements. We also give a simple proof of the recently discovered $O(k^2 \log |T|)$-approximation algorithm for the single-source version of vertex-connectivity SNDP. Our results establish a natural connection between vertex-connectivity and a well-understood generalization of edge-connectivity, namely, element-connectivity, in that, any instance of vertex-connectivity can be expressed by a small number of instances of the element-connectivity problem.