Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2407.11101 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866917815463706624 |
|---|---|
| author | Çivril, Ali |
| author_facet | Çivril, Ali |
| contents | We describe a $\frac{3}{2}$-approximation algorithm for the Forest Augmentation Problem (\textsf{FAP}), which is a special case of the Weighted 2-Edge-Connected Spanning Subgraph Problem (\textsf{Weighted 2-ECSS}). This significantly improves upon the previous best ratio $1.9973$, and proceeds toward the goal of a $\frac{3}{2}$-approximation algorithm for \textsf{Weighted 2-ECSS}. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2407_11101 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | 3/2-Approximation for the Forest Augmentation Problem Çivril, Ali Data Structures and Algorithms We describe a $\frac{3}{2}$-approximation algorithm for the Forest Augmentation Problem (\textsf{FAP}), which is a special case of the Weighted 2-Edge-Connected Spanning Subgraph Problem (\textsf{Weighted 2-ECSS}). This significantly improves upon the previous best ratio $1.9973$, and proceeds toward the goal of a $\frac{3}{2}$-approximation algorithm for \textsf{Weighted 2-ECSS}. |
| title | 3/2-Approximation for the Forest Augmentation Problem |
| topic | Data Structures and Algorithms |
| url | https://arxiv.org/abs/2407.11101 |