A primal-dual approximation algorithm for generalized Steiner network problems
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Biconnectivity approximations and graph carvings
Journal of the ACM (JACM)
A General Approximation Technique for Constrained Forest Problems
SIAM Journal on Computing
Approximation algorithms for finding highly connected subgraphs
Approximation algorithms for NP-hard problems
Improved approximation algorithms for biconnected subgraphs via better lower bounding techniques
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Improved approximation algorithms for network design problems
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Approximating multiroot 3-outconnected subgraphs
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Local Search in Combinatorial Optimization
Local Search in Combinatorial Optimization
A Factor 2 Approximation Algorithm for the Generalized Steiner Network Problem
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Approximating minimum-size k-connected spanning subgraphs via matching
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Approximation schemes for minimum 2-connected spanning subgraphs in weighted planar graphs
ESA'05 Proceedings of the 13th annual European conference on Algorithms
| Hi-index | 0.05 |
The problem of finding the minimum size 2-connected subgraph is a classical problem in network design. It is known to be NP-hard even on cubic planar graphs and MAX SNP-hard. We study the generalization of this problem, where requirements of 1 or 2 edge or vertex disjoint paths are specified between every pair of vertices, and the aim is to find a minimum size subgraph satisfying these requirements. For both problems we give 3/2-approximation algorithms. This improves on the straightforward 2-approximation algorithms for these problems, and generalizes earlier results for 2-connectivity. We also give analyses of the classical local optimization heuristics for these two network design problems.