On the maximum size of a minimal k-edge connected augmentation

Authors:
Andre V. Kotlov;Joseph Cheriyan
Affiliations:
-;Department of Combinatorics and Optimization, University of Waterloo, Waterloo, Ontario N2L3G1, Canada
Venue:
Journal of Combinatorial Theory Series B
Year:
2012

Citing 7
Cited 0

Biconnectivity approximations and graph carvings

Journal of the ACM (JACM)
Approximation algorithms for finding highly connected subgraphs

Approximation algorithms for NP-hard problems
Combinatorial optimization

Combinatorial optimization
Approximating Minimum-Size k-Connected Spanning Subgraphs via Matching

SIAM Journal on Computing
A 5/4-approximation algorithm for minimum 2-edge-connectivity

SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Graph Theory With Applications

Graph Theory With Applications
Iterated rounding algorithms for the smallest k-edge connected spanning subgraph

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a short proof of a generalization of a result of Cheriyan and Thurimella: a simple graph of minimum degree k can be augmented to a k-edge connected simple graph by adding =