An Efficient Approximation Algorithm for the Steiner Tree Problem

Chi-Yeh Chen, Sun-Yuan Hsieh. An Efficient Approximation Algorithm for the Steiner Tree Problem. In Ding-Zhu Du, Jie Wang, editors, Complexity and Approximation - In Memory of Ker-I Ko. Volume 12000 of Lecture Notes in Computer Science, pages 238-251, Springer, 2020. [doi]

@inproceedings{ChenH20-4,
  title = {An Efficient Approximation Algorithm for the Steiner Tree Problem},
  author = {Chi-Yeh Chen and Sun-Yuan Hsieh},
  year = {2020},
  doi = {10.1007/978-3-030-41672-0_15},
  url = {https://doi.org/10.1007/978-3-030-41672-0_15},
  researchr = {https://researchr.org/publication/ChenH20-4},
  cites = {0},
  citedby = {0},
  pages = {238-251},
  booktitle = {Complexity and Approximation - In Memory of Ker-I Ko},
  editor = {Ding-Zhu Du and Jie Wang},
  volume = {12000},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-030-41672-0},
}