A better approximation ratio for the minimum size k-edge-connected spanning subgraph problem

On approximability of the minimum-cost k-connected spanning subgraph problem

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms

Approximability of dense and sparse instances of minimum 2-connectivity, TSP and path problems

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms

An ear decomposition approach to approximating the smallest 3-edge connected spanning subgraph of a multigraph

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms

Approximating minimum size {1,2}-connected networks

Discrete Applied Mathematics

Better performance bounds for finding the smallest k-edge connected spanning subgraph of a multigraph

SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms

A 5/4-approximation algorithm for minimum 2-edge-connectivity

SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms

Approximation Algorithms for Minimum Size 2-Connectivity Problems

STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science

Hardness of Approximation for Vertex-Connectivity Network-Design Problems

APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization

On the Hardness of Constructing Minimal 2-Connected Spanning Subgraphs in Complete Graphs with Sharpened Triangle Inequality

FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science

Approximation schemes for minimum 2-edge-connected and biconnected subgraphs in planar graphs

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms

On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality

Theoretical Computer Science

Approximating the smallest k-edge connected spanning subgraph by LP-rounding

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms

Iterated rounding algorithms for the smallest k-edge connected spanning subgraph

Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms

On k-connectivity problems with sharpened triangle inequality

Journal of Discrete Algorithms

On k-edge-connectivity problems with sharpened triangle inequality

CIAC'03 Proceedings of the 5th Italian conference on Algorithms and complexity

Approximation algorithms for the minimum cardinality two-connected spanning subgraph problem

IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization

Network flow spanners

LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics

Iterated Rounding Algorithms for the Smallest k-Edge Connected Spanning Subgraph

SIAM Journal on Computing