3/2-Approximation for the Forest Augmentation Problem

TL;DR

This paper presents a 3/2-approximation algorithm for the Forest Augmentation Problem, advancing the approximation ratio closer to the optimal 3/2 bound for related network design problems.

Contribution

It introduces a novel 3/2-approximation algorithm for FAP, improving upon the previous ratio of 1.9973 and contributing toward better solutions for Weighted 2-ECSS.

Findings

Achieved a 3/2-approximation ratio for FAP.

Improved the previous best ratio of 1.9973.

Progressed toward a 3/2-approximation for Weighted 2-ECSS.

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