@inproceedings{Boyd2008A3A, title={A 32-Approximation Algorithm for the Multi-two-edge Connected Subgraph Problem}, author={Sylvia C. Boyd and Amy R. Cameron}, year={2008} }

- Published 2008

We present a 3 2 -approximation algorithm for the two-edge connected problem on a complete graph with non-negative costs, and multi-edges allowed in the solution. Previously, 2 was the best known performance guarantee.

### Presentations referencing similar topics