Work

3/2-Approximation for the Forest Augmentation Problem

Year: 2024

Type: preprint

Abstract: 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}.

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.2407.11101

Author: Çivril, Ali

Institution: Atlas Üniversitesi

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

Funder: Türkiye Bilimsel ve Teknolojik Araştırma Kurumu

OpenAlex ID: W4403794490

Cites:

Cited by:

Related to: 10