Cite
An efficient 3-approximation algorithm for the Steiner tree problem with the minimum number of Steiner points and bounded edge length.
MLA
Shin, Donghoon, and Sunghee Choi. “An Efficient 3-Approximation Algorithm for the Steiner Tree Problem with the Minimum Number of Steiner Points and Bounded Edge Length.” PLoS ONE, vol. 18, no. 11, Nov. 2023, pp. 1–18. EBSCOhost, https://doi.org/10.1371/journal.pone.0294353.
APA
Shin, D., & Choi, S. (2023). An efficient 3-approximation algorithm for the Steiner tree problem with the minimum number of Steiner points and bounded edge length. PLoS ONE, 18(11), 1–18. https://doi.org/10.1371/journal.pone.0294353
Chicago
Shin, Donghoon, and Sunghee Choi. 2023. “An Efficient 3-Approximation Algorithm for the Steiner Tree Problem with the Minimum Number of Steiner Points and Bounded Edge Length.” PLoS ONE 18 (11): 1–18. doi:10.1371/journal.pone.0294353.