Approximation algorithms for forests augmentation ensuring two disjoint paths of bounded length

Victor Chepoi, Bertrand Estellon, Yann Vaxès. Approximation algorithms for forests augmentation ensuring two disjoint paths of bounded length. Theoretical Computer Science, 401(1-3):131-143, 2008. [doi]

@article{ChepoiEV08,
  title = {Approximation algorithms for forests augmentation ensuring two disjoint paths of bounded length},
  author = {Victor Chepoi and Bertrand Estellon and Yann Vaxès},
  year = {2008},
  doi = {10.1016/j.tcs.2008.03.028},
  url = {http://dx.doi.org/10.1016/j.tcs.2008.03.028},
  researchr = {https://researchr.org/publication/ChepoiEV08},
  cites = {0},
  citedby = {0},
  journal = {Theoretical Computer Science},
  volume = {401},
  number = {1-3},
  pages = {131-143},
}