Minimal edge-coverings of pairs of sets
Journal of Combinatorial Theory Series B
Improved approximation algorithms for uniform connectivity problems
Journal of Algorithms
Improved approximation algorithms for network design problems
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Erratum: an approximation algorithm for minimum-cost vertex-connectivity problems
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
A primal-dual schema based approximation algorithm for the element connectivity problem
Journal of Algorithms
A primal-dual approximation algorithm for the survivable network design problem in hypergraphs
Discrete Applied Mathematics
Fast Approximation Algorithms for Fractional Steiner Forest and Related Problems
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
An Iterative Rounding 2-Approximation Algorithm for the Element Connectivity Problem
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
A fast approximation scheme for fractional covering problems with variable upper bounds
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Hardness of Approximation for Vertex-Connectivity Network Design Problems
SIAM Journal on Computing
Survivable network design with degree or order constraints
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Approximating minimum bounded degree spanning trees to within one of optimal
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Approximation algorithms for node-weighted buy-at-bulk network design
SODA '07 Proceedings of the eighteenth 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
Online and stochastic survivable network design
Proceedings of the forty-first annual ACM symposium on Theory of computing
A Graph Reduction Step Preserving Element-Connectivity and Applications
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
A note on Rooted Survivable Networks
Information Processing Letters
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
Approximating connectivity augmentation problems
ACM Transactions on Algorithms (TALG)
Tree embeddings for two-edge-connected network design
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Approximation Algorithms for Nonuniform Buy-at-Bulk Network Design
SIAM Journal on Computing
Buy-at-Bulk Network Design with Protection
Mathematics of Operations Research
Approximating minimum cost source location problems with local vertex-connectivity demands
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
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
Black-box reductions for cost-sharing mechanism design
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Improved algorithm for degree bounded survivable network design problem
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
Degree-Constrained node-connectivity
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Survivable network activation problems
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Modular community detection in networks
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
Simpler analysis of LP extreme points for traveling salesman and survivable network design problems
Operations Research Letters
Approximating minimum-cost connectivity problems via uncrossable bifamilies
ACM Transactions on Algorithms (TALG)
ICONIP'12 Proceedings of the 19th international conference on Neural Information Processing - Volume Part I
Survivable network activation problems
Theoretical Computer Science
| Hi-index | 0.00 |
The survivable network design problem (SNDP) is the following problem: given an undirected graph and values rij for each pair of vertices i and j, find a minimum-cost subgraph such that there are at least rij disjoint paths between vertices i and j. In the edge connected version of this problem (EC-SNDP), these paths must be edge-disjoint. In the vertex connected version of the problem (VC-SNDP), the paths must be vertex disjoint. The element connectivity problem (ELC-SNDP, or ELC) is a problem of intermediate difficulty. In this problem, the set of vertices is partitioned into terminals and nonterminals. The edges and nonterminals of the graph are called elements. The values rij are only specified for pairs of terminals i, j, and the paths from i to j must be element disjoint. Thus if rij-1 elements fail, terminals i and j are still connected by a path in the network.These variants of SNDP are all known to be NP-hard. The best known approximation algorithm for the EC-SNDP has performance guarantee of 2 and iteratively rounds solutions to a linear programming relaxation of the problem. ELC has a primal-dual O(log k)-approximation algorithm, where k = maxi,j rij. Since this work first appeared as an extended abstract, it has been shown that it is hard to approximate VC-SNDP to factor 2log1-εn.In this paper we investigate applying iterative rounding to ELC and VC-SNDP We show that iterative rounding will not yield a constant factor approximation algorithm for general VC-SNDP. On the other hand, we show how to extend the analysis of iterative rounding applied to EC-SNDP to yield 2-approximation algorithms for both general ELC, and for the case of VC-SNDP when rij ∈ {0, 1, 2}. The latter result improves on an existing 3-approximation algorithm. The former is the first constant factor approximation algorithm for a general survivable network design problem that allows node failures.