Design networks with bounded pairwise distance
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Approximating Minimum-Size k-Connected Spanning Subgraphs via Matching
SIAM Journal on Computing
Approximations for ATSP with Parametrized Triangle Inequality
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Approximation Algorithms for Network Design with Metric Costs
SIAM Journal on Discrete Mathematics
On k-connectivity problems with sharpened triangle inequality
Journal of Discrete Algorithms
Algorithms for Single-Source Vertex Connectivity
FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
An almost O(log k)-approximation for k-connected subgraphs
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Inapproximability of survivable networks
Theoretical Computer Science
FOCS '09 Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science
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
Small ℓ-edge-covers in k-connected graphs
Discrete Applied Mathematics
| Hi-index | 0.00 |
The Survivable Network Design (SND) problem seeks a minimum-cost subgraph that satisfies prescribed node-connectivity requirements. We consider SND on both directed and undirected complete graphs with @b-metric costs when c(xz)==4 and 12+3k-22(4k^2-7k+2)=