Improved approximation algorithms for uniform connectivity problems
Journal of Algorithms
Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems
Journal of Computer and System Sciences - Special issue on FOCS 2001
Additive approximation for bounded degree survivable network design
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Rooted k-connections in digraphs
Discrete Applied Mathematics
Survivable Network Design with Degree or Order Constraints
SIAM Journal on Computing
An O(k^3 log n)-Approximation Algorithm for Vertex-Connectivity Survivable Network Design
FOCS '09 Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science
Additive Guarantees for Degree-Bounded Directed Network Design
SIAM Journal on Computing
Approximating directed weighted-degree constrained networks
Theoretical Computer Science
Iterative Methods in Combinatorial Optimization
Iterative Methods in Combinatorial Optimization
Network-design with degree constraints
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
Degree Bounded Network Design with Metric Costs
SIAM Journal on Computing
Network design with weighted degree constraints
Discrete Optimization
| Hi-index | 0.00 |
We give a general framework to handle node-connectivity degree constrained problems. In particular, for the k-Outconnected Subgraph problem, for both directed and undirected graphs, our algorithm computes in polynomial time a solution J of cost O(logk) times the optimal, such that degJ(v)=O(2k) ·b(v) for all v∈V. Similar result are obtained for the Element-Connectivity and the k-Connected Subgraph problems. The latter is a significant improvement on the particular case of only degree-approximation and undirected graphs considered in [5]. In addition, for the edge-connectivity directed Degree-Constrainedk-Outconnected Subgraph problem, we slightly improve the best known approximation ratio, by a simple proof.