A 4/3-Approximation Algorithm for the Minimum 2-Edge Connected Subgraph Problem

Christoph Hunkenschröder, Santosh S. Vempala, Adrian Vetta. A 4/3-Approximation Algorithm for the Minimum 2-Edge Connected Subgraph Problem. ACM Transactions on Algorithms, 15(4), 2019. [doi]

@article{HunkenschroderV19,
  title = {A 4/3-Approximation Algorithm for the Minimum 2-Edge Connected Subgraph Problem},
  author = {Christoph Hunkenschröder and Santosh S. Vempala and Adrian Vetta},
  year = {2019},
  doi = {10.1145/3341599},
  url = {https://doi.org/10.1145/3341599},
  researchr = {https://researchr.org/publication/HunkenschroderV19},
  cites = {0},
  citedby = {0},
  journal = {ACM Transactions on Algorithms},
  volume = {15},
  number = {4},
}