Prabhakar Gubbala, Balaji Raghavachari. Approximation Algorithms for the Minimum Cardinality Two-Connected Spanning Subgraph Problem. In Michael Jünger, Volker Kaibel, editors, Integer Programming and Combinatorial Optimization, 11th International IPCO Conference, Berlin, Germany, June 8-10, 2005, Proceedings. Volume 3509 of Lecture Notes in Computer Science, pages 422-436, Springer, 2005. [doi]
@inproceedings{GubbalaR05,
title = {Approximation Algorithms for the Minimum Cardinality Two-Connected Spanning Subgraph Problem},
author = {Prabhakar Gubbala and Balaji Raghavachari},
year = {2005},
doi = {10.1007/11496915_31},
url = {http://dx.doi.org/10.1007/11496915_31},
researchr = {https://researchr.org/publication/GubbalaR05},
cites = {0},
citedby = {0},
pages = {422-436},
booktitle = {Integer Programming and Combinatorial Optimization, 11th International IPCO Conference, Berlin, Germany, June 8-10, 2005, Proceedings},
editor = {Michael Jünger and Volker Kaibel},
volume = {3509},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-26199-0},
}