9/7-Approximation for Two-Edge-Connectivity and Two-Vertex-Connectivity
<|reference_start|>9/7-Approximation for Two-Edge-Connectivity and Two-Vertex-Connectivity: We provide algorithms for the minimum 2-edge-connected spanning subgraph problem and the minimum 2-vertex-connected spanning subgraph problem with approximation ratio $\frac{9}{7}$. This improves upon a recent algorithm with ratio slightly smaller than $\frac{4}{3}$ for 2-edge-connectivity, and another one with ratio $\frac{4}{3}$ for 2-vertex-connectivity.<|reference_end|>
@article{çivril20249/7-approximation,
    title={9/7-Approximation for Two-Edge-Connectivity and Two-Vertex-Connectivity},
    author={Ali c{C}ivril},
    journal={arXiv preprint arXiv:2407.10526},
    year={2024},
    archivePrefix={arXiv},
    eprint={2407.10526},
    primaryClass={cs.DS}
}