Approximation Algorithms for Priority Steiner Tree Problems

Faryad Darabi Sahneh, Stephen G. Kobourov, Richard Spence. Approximation Algorithms for Priority Steiner Tree Problems. In Chi-Yeh Chen, Wing-Kai Hon, Ling-Ju Hung, Chia-Wei Lee, editors, Computing and Combinatorics - 27th International Conference, COCOON 2021, Tainan, Taiwan, October 24-26, 2021, Proceedings. Volume 13025 of Lecture Notes in Computer Science, pages 112-123, Springer, 2021. [doi]

@inproceedings{SahnehKS21,
  title = {Approximation Algorithms for Priority Steiner Tree Problems},
  author = {Faryad Darabi Sahneh and Stephen G. Kobourov and Richard Spence},
  year = {2021},
  doi = {10.1007/978-3-030-89543-3_10},
  url = {https://doi.org/10.1007/978-3-030-89543-3_10},
  researchr = {https://researchr.org/publication/SahnehKS21},
  cites = {0},
  citedby = {0},
  pages = {112-123},
  booktitle = {Computing and Combinatorics - 27th International Conference, COCOON 2021, Tainan, Taiwan, October 24-26, 2021, Proceedings},
  editor = {Chi-Yeh Chen and Wing-Kai Hon and Ling-Ju Hung and Chia-Wei Lee},
  volume = {13025},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-030-89543-3},
}