A Simple Primal-Dual Approximation Algorithm for 2-Edge-Connected Spanning Subgraphs

Stephan Beyer, Markus Chimani, Joachim Spoerhase. A Simple Primal-Dual Approximation Algorithm for 2-Edge-Connected Spanning Subgraphs. In Donghyun Kim 0001, R. N. Uma, Zhipeng Cai 0001, Dong Hoon Lee 0001, editors, Computing and Combinatorics - 26th International Conference, COCOON 2020, Atlanta, GA, USA, August 29-31, 2020, Proceedings. Volume 12273 of Lecture Notes in Computer Science, pages 347-359, Springer, 2020. [doi]

@inproceedings{BeyerCS20,
  title = {A Simple Primal-Dual Approximation Algorithm for 2-Edge-Connected Spanning Subgraphs},
  author = {Stephan Beyer and Markus Chimani and Joachim Spoerhase},
  year = {2020},
  doi = {10.1007/978-3-030-58150-3_28},
  url = {https://doi.org/10.1007/978-3-030-58150-3_28},
  researchr = {https://researchr.org/publication/BeyerCS20},
  cites = {0},
  citedby = {0},
  pages = {347-359},
  booktitle = {Computing and Combinatorics - 26th International Conference, COCOON 2020, Atlanta, GA, USA, August 29-31, 2020, Proceedings},
  editor = {Donghyun Kim 0001 and R. N. Uma and Zhipeng Cai 0001 and Dong Hoon Lee 0001},
  volume = {12273},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-030-58150-3},
}