A 4/3-Approximation Algorithm for Minimum 3-Edge-Connectivity

Prabhakar Gubbala, Balaji Raghavachari. A 4/3-Approximation Algorithm for Minimum 3-Edge-Connectivity. In Frank K. H. A. Dehne, Jörg-Rüdiger Sack, Norbert Zeh, editors, Algorithms and Data Structures, 10th International Workshop, WADS 2007, Halifax, Canada, August 15-17, 2007, Proceedings. Volume 4619 of Lecture Notes in Computer Science, pages 39-51, Springer, 2007. [doi]

@inproceedings{GubbalaR07,
  title = {A 4/3-Approximation Algorithm for Minimum 3-Edge-Connectivity},
  author = {Prabhakar Gubbala and Balaji Raghavachari},
  year = {2007},
  doi = {10.1007/978-3-540-73951-7_5},
  url = {http://dx.doi.org/10.1007/978-3-540-73951-7_5},
  researchr = {https://researchr.org/publication/GubbalaR07},
  cites = {0},
  citedby = {0},
  pages = {39-51},
  booktitle = {Algorithms and Data Structures, 10th International Workshop, WADS 2007, Halifax, Canada, August 15-17, 2007, Proceedings},
  editor = {Frank K. H. A. Dehne and Jörg-Rüdiger Sack and Norbert Zeh},
  volume = {4619},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-540-73948-7},
}