Davide Bilò, Guido Proietti. A 5/4-Approximation Algorithm for Biconnecting a Graph with a Given Hamiltonian Path. In Giuseppe Persiano, Roberto Solis-Oba, editors, Approximation and Online Algorithms, Second International Workshop, WAOA 2004, Bergen, Norway, September 14-16, 2004, Revised Selected Papers. Volume 3351 of Lecture Notes in Computer Science, pages 181-196, Springer, 2004. [doi]
@inproceedings{BiloP04:0,
title = {A 5/4-Approximation Algorithm for Biconnecting a Graph with a Given Hamiltonian Path},
author = {Davide Bilò and Guido Proietti},
year = {2004},
url = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=3351&spage=181},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/BiloP04%3A0},
cites = {0},
citedby = {0},
pages = {181-196},
booktitle = {Approximation and Online Algorithms, Second International Workshop, WAOA 2004, Bergen, Norway, September 14-16, 2004, Revised Selected Papers},
editor = {Giuseppe Persiano and Roberto Solis-Oba},
volume = {3351},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-24574-X},
}