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

DOI10.1016/j.jctb.2011.06.004zbMath1235.90172OpenAlexW2061275745MaRDI QIDQ765200

Andreĭ V. Kotlov, Joseph Cheriyan

Publication date: 19 March 2012

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jctb.2011.06.004

zbMATH Keywords

approximation algorithmsedge connectivityconnectivity augmentation\(k\)-edge connected spanning subgraphs

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation algorithms (68W25) Connectivity (05C40)

Cites Work

• A factor 2 approximation algorithm for the generalized Steiner network problem
• Ecken vom Grad \(n\) in minimalen \(n\)-fach zusammenhängenden Graphen
• A 4/3-Approximation Algorithm for Minimum 3-Edge-Connectivity
• Biconnectivity approximations and graph carvings
• Approximating Minimum-Size k-Connected Spanning Subgraphs via Matching
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the maximum size of a minimal \(k\)-edge connected augmentation