Sylvia Boyd, Philippe Legault. Toward a 6/5 Bound for the Minimum Cost 2-Edge Connected Subgraph Problem. Electronic Notes in Discrete Mathematics, 50:427-432, 2015. [doi]
@article{BoydL15,
title = {Toward a 6/5 Bound for the Minimum Cost 2-Edge Connected Subgraph Problem},
author = {Sylvia Boyd and Philippe Legault},
year = {2015},
doi = {10.1016/j.endm.2015.07.071},
url = {http://dx.doi.org/10.1016/j.endm.2015.07.071},
researchr = {https://researchr.org/publication/BoydL15},
cites = {0},
citedby = {0},
journal = {Electronic Notes in Discrete Mathematics},
volume = {50},
pages = {427-432},
}