Answers are grounded in this paper and cite their sources.
We present a factor 4/3 approximation algorithm for the problem of finding a minimum 2-edge connected spanning subgraph of a given undirected multigraph. The algorithm is based upon a reduction to a restricted class of graphs. In these graphs, the approximation algorithm constructs a 2-edge connected spanning subgraph by modifying the smallest 2-edge cover.
No takes yet. Share an insight, caveat, or question.
Hunkenschröder et al. (2019) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: