Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2407.10526 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866913519077687296 |
|---|---|
| author | Çivril, Ali |
| author_facet | Çivril, Ali |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2407_10526 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | 9/7-Approximation for Two-Edge-Connectivity and Two-Vertex-Connectivity Çivril, Ali Data Structures and Algorithms 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. |
| title | 9/7-Approximation for Two-Edge-Connectivity and Two-Vertex-Connectivity |
| topic | Data Structures and Algorithms |
| url | https://arxiv.org/abs/2407.10526 |