Harold N. Gabow. Special edges, and approximating the smallest directed ::::k::::-edge connected spanning subgraph. In J. Ian Munro, editor, Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2004, New Orleans, Louisiana, USA, January 11-14, 2004. pages 234-243, SIAM, 2004. [doi]
@inproceedings{Gabow04,
title = {Special edges, and approximating the smallest directed ::::k::::-edge connected spanning subgraph},
author = {Harold N. Gabow},
year = {2004},
doi = {10.1145/982792.982826},
url = {http://doi.acm.org/10.1145/982792.982826},
researchr = {https://researchr.org/publication/Gabow04},
cites = {0},
citedby = {0},
pages = {234-243},
booktitle = {Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2004, New Orleans, Louisiana, USA, January 11-14, 2004},
editor = {J. Ian Munro},
publisher = {SIAM},
}