3/2-Approximation for the Forest Augmentation Problem
<|reference_start|>3/2-Approximation for the Forest Augmentation Problem: 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}.<|reference_end|>
@article{çivril20243/2-approximation,
    title={3/2-Approximation for the Forest Augmentation Problem},
    author={Ali c{C}ivril},
    journal={arXiv preprint arXiv:2407.11101},
    year={2024},
    archivePrefix={arXiv},
    eprint={2407.11101},
    primaryClass={cs.DS}
}