We provide an algorithm for the minimum 2-edge-connected spanning subgraph problem with approximation ratio 9/7. This improves upon a recent algorithm with ratio slightly smaller than 4/3.
No takes yet. Share an insight, caveat, or question.
Ali Çivril (2024) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: