Loukas Georgiadis, Giuseppe F. Italiano, Charis Papadopoulos, Nikos Parotsidis. Approximating the Smallest Spanning Subgraph for 2-Edge-Connectivity in Directed Graphs. In Nikhil Bansal, Irene Finocchi, editors, Algorithms - ESA 2015 - 23rd Annual European Symposium, Patras, Greece, September 14-16, 2015, Proceedings. Volume 9294 of Lecture Notes in Computer Science, pages 582-594, Springer, 2015. [doi]
@inproceedings{GeorgiadisIPP15,
title = {Approximating the Smallest Spanning Subgraph for 2-Edge-Connectivity in Directed Graphs},
author = {Loukas Georgiadis and Giuseppe F. Italiano and Charis Papadopoulos and Nikos Parotsidis},
year = {2015},
doi = {10.1007/978-3-662-48350-3_49},
url = {http://dx.doi.org/10.1007/978-3-662-48350-3_49},
researchr = {https://researchr.org/publication/GeorgiadisIPP15},
cites = {0},
citedby = {0},
pages = {582-594},
booktitle = {Algorithms - ESA 2015 - 23rd Annual European Symposium, Patras, Greece, September 14-16, 2015, Proceedings},
editor = {Nikhil Bansal and Irene Finocchi},
volume = {9294},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-662-48349-7},
}