Loukas Georgiadis, Giuseppe F. Italiano, Aikaterini Karanasiou. Approximating the Smallest 2-Vertex-Connected Spanning Subgraph via Low-High Orders. In Costas S. Iliopoulos, Solon P. Pissis, Simon J. Puglisi, Rajeev Raman, editors, 16th International Symposium on Experimental Algorithms, SEA 2017, June 21-23, 2017, London, UK. Volume 75 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2017. [doi]
@inproceedings{GeorgiadisIK17,
title = {Approximating the Smallest 2-Vertex-Connected Spanning Subgraph via Low-High Orders},
author = {Loukas Georgiadis and Giuseppe F. Italiano and Aikaterini Karanasiou},
year = {2017},
doi = {10.4230/LIPIcs.SEA.2017.9},
url = {https://doi.org/10.4230/LIPIcs.SEA.2017.9},
researchr = {https://researchr.org/publication/GeorgiadisIK17},
cites = {0},
citedby = {0},
booktitle = {16th International Symposium on Experimental Algorithms, SEA 2017, June 21-23, 2017, London, UK},
editor = {Costas S. Iliopoulos and Solon P. Pissis and Simon J. Puglisi and Rajeev Raman},
volume = {75},
series = {LIPIcs},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
isbn = {978-3-95977-036-1},
}