APA (7th ed.) Citation

Keikha, V., Löffler, M., & Mohades, A. (2020). A fully polynomial time approximation scheme for the smallest diameter of imprecise points. Theoretical computer science, 814, 259-270. https://doi.org/10.1016/j.tcs.2020.02.006

Chicago Style (17th ed.) Citation

Keikha, Vahideh, Maarten Löffler, and Ali Mohades. "A Fully Polynomial Time Approximation Scheme for the Smallest Diameter of Imprecise Points." Theoretical Computer Science 814 (2020): 259-270. https://doi.org/10.1016/j.tcs.2020.02.006.

MLA (9th ed.) Citation

Keikha, Vahideh, et al. "A Fully Polynomial Time Approximation Scheme for the Smallest Diameter of Imprecise Points." Theoretical Computer Science, vol. 814, 2020, pp. 259-270, https://doi.org/10.1016/j.tcs.2020.02.006.