  We describe a $\frac{3}{2}$-approximation algorithm for the Matching
Augmentation Problem, which is a special case of the weighted 2-edge-connected
spanning subgraph problem. This improves upon the previous best ratio
$\frac{13}{8}$.
