Key points are not available for this paper at this time.
We provide an algorithm for the minimum 2-edge-connected spanning subgraph problem with approximation ratio 97. This improves upon a recent algorithm with ratio slightly smaller than 43.
Ali Çivril (Mon,) studied this question.