A better approximation algorithm for the budget prize collecting tree problem

Asaf Levin. A better approximation algorithm for the budget prize collecting tree problem. Oper. Res. Lett., 32(4):316-319, 2004. [doi]

@article{Levin04:0,
  title = {A better approximation algorithm for the budget prize collecting tree problem},
  author = {Asaf Levin},
  year = {2004},
  doi = {10.1016/j.orl.2003.11.002},
  url = {http://dx.doi.org/10.1016/j.orl.2003.11.002},
  researchr = {https://researchr.org/publication/Levin04%3A0},
  cites = {0},
  citedby = {0},
  journal = {Oper. Res. Lett.},
  volume = {32},
  number = {4},
  pages = {316-319},
}