A linear time algorithm for triconnectivity augmentation (extended abstract)
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
The traveling salesman problem with distances one and two
Mathematics of Operations Research
Approximation algorithms for graph augmentation
Journal of Algorithms
A minimum 3-connectivity augmentation of a graph
Journal of Computer and System Sciences
On the optimal vertex-connectivity augmentation
Journal of Combinatorial Theory Series B
The hardness of approximation: gap location
Computational Complexity
Improved approximation algorithms for uniform connectivity problems
Journal of Algorithms
Approximation algorithms for finding highly connected subgraphs
Approximation algorithms for NP-hard problems
Approximation algorithms for NP-hard problems
Proof verification and the hardness of approximation problems
Journal of the ACM (JACM)
SIAM Journal on Computing
A threshold of ln n for approximating set cover
Journal of the ACM (JACM)
On approximability of the minimum-cost k-connected spanning subgraph problem
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Approximation algorithms
Approximation algorithms for minimum-cost k-vertex connected subgraphs
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Erratum: an approximation algorithm for minimum-cost vertex-connectivity problems
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Approximating Minimum-Size k-Connected Spanning Subgraphs via Matching
SIAM Journal on Computing
Approximating the Domatic Number
SIAM Journal on Computing
Approximating node connectivity problems via set covers
APPROX '00 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization
An Iterative Rounding 2-Approximation Algorithm for the Element Connectivity Problem
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
On four-connecting a triconnected graph
SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science
Deploying sensor networks with guaranteed capacity and fault tolerance
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
Design method of robust networks against performance deterioration during failures
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Deploying sensor networks with guaranteed fault tolerance
IEEE/ACM Transactions on Networking (TON)
k-edge-connectivity: approximation and LP relaxation
WAOA'10 Proceedings of the 8th international conference on Approximation and online algorithms
A 5/4-approximation algorithm for biconnecting a graph with a given hamiltonian path
WAOA'04 Proceedings of the Second international conference on Approximation and Online Algorithms
| Hi-index | 0.00 |
In the survivable network design problem SNDP, the goal is to find a minimum-cost subgraph satisfying certain connectivity requirements. We study the vertex-connectivity variant of SNDP in which the input specifies, for each pair of vertices, a required number of vertexdisjoint paths connecting them.We give the first lower bound on the approximability of SNDP, showing that the problem admits no efficient 2log1-驴n ratio approximation for any fixed 驴 0 unless NP 驴 DTIME(npolylog(n)). We also show hardness of approximation results for several important special cases of SNDP, including constant factor hardness for the k-vertex connected spanning subgraph problem (k-VCSS) and for the vertex-connectivity augmentation problem, even when the edge costs are severely restricted.