5/4-Approximation of Minimum 2-Edge-Connected Spanning Subgraph

11/17/2019

∙

by   Ali Çivril, et al.

∙

0

∙

share

We provide a 5/4-approximation algorithm for the 2-edge connected spanning subgraph problem. This improves upon the previous best ratio of 4/3. The algorithm is based on applying local improvement steps on a starting solution provided by a standard ear decomposition. Unlike previous approaches, we consider modifications involving 5-ears together with 3-ears.