A 2-Approximation for the k-Prize-Collecting Steiner Tree Problem

Lehilton Lelis Chaves Pedrosa, Hugo Kooki Kasuya Rosado. A 2-Approximation for the k-Prize-Collecting Steiner Tree Problem. Algorithmica, 84(12):3522-3558, 2022. [doi]

@article{PedrosaR22,
  title = {A 2-Approximation for the k-Prize-Collecting Steiner Tree Problem},
  author = {Lehilton Lelis Chaves Pedrosa and Hugo Kooki Kasuya Rosado},
  year = {2022},
  doi = {10.1007/s00453-021-00919-3},
  url = {https://doi.org/10.1007/s00453-021-00919-3},
  researchr = {https://researchr.org/publication/PedrosaR22},
  cites = {0},
  citedby = {0},
  journal = {Algorithmica},
  volume = {84},
  number = {12},
  pages = {3522-3558},
}