Victor Chepoi, Bertrand Estellon, Yann Vaxès. Approximation Algorithms for Forests Augmentation Ensuring Two Disjoint Paths of Bounded Length. In Frank K. H. A. Dehne, Alejandro López-Ortiz, Jörg-Rüdiger Sack, editors, Algorithms and Data Structures, 9th International Workshop, WADS 2005, Waterloo, Canada, August 15-17, 2005, Proceedings. Volume 3608 of Lecture Notes in Computer Science, pages 282-293, Springer, 2005. [doi]
@inproceedings{ChepoiEV05,
title = {Approximation Algorithms for Forests Augmentation Ensuring Two Disjoint Paths of Bounded Length},
author = {Victor Chepoi and Bertrand Estellon and Yann Vaxès},
year = {2005},
doi = {10.1007/11534273_25},
url = {http://dx.doi.org/10.1007/11534273_25},
researchr = {https://researchr.org/publication/ChepoiEV05},
cites = {0},
citedby = {0},
pages = {282-293},
booktitle = {Algorithms and Data Structures, 9th International Workshop, WADS 2005, Waterloo, Canada, August 15-17, 2005, Proceedings},
editor = {Frank K. H. A. Dehne and Alejandro López-Ortiz and Jörg-Rüdiger Sack},
volume = {3608},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-28101-0},
}