Wang, H., & Xue, J. (2020). Near-Optimal Algorithms for Shortest Paths in Weighted Unit-Disk Graphs. Discrete & computational geometry, 64(4), 1141-1166. https://doi.org/10.1007/s00454-020-00219-7
Chicago Style (17th ed.) CitationWang, Haitao, and Jie Xue. "Near-Optimal Algorithms for Shortest Paths in Weighted Unit-Disk Graphs." Discrete & Computational Geometry 64, no. 4 (2020): 1141-1166. https://doi.org/10.1007/s00454-020-00219-7.
MLA (9th ed.) CitationWang, Haitao, and Jie Xue. "Near-Optimal Algorithms for Shortest Paths in Weighted Unit-Disk Graphs." Discrete & Computational Geometry, vol. 64, no. 4, 2020, pp. 1141-1166, https://doi.org/10.1007/s00454-020-00219-7.
Warning: These citations may not always be 100% accurate.