3/2-Approximation for the Forest Augmentation Problem

We describe a $\frac{3}{2}$-approximation algorithm for the Forest Augmentation Problem ($\mathsf{\text{FAP}}$), which is a special case of the Weighted 2-Edge-Connected Spanning Subgraph Problem ($\mathsf{\text{Weighted}}\mathsf{\text{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 $\mathsf{\text{Weighted}}\mathsf{\text{2-ECSS}}$.