Cite
The Parameterized Hardness of the k-Center Problem in Transportation Networks.
MLA
Feldmann, Andreas Emil, and Dániel Marx. “The Parameterized Hardness of the K-Center Problem in Transportation Networks.” Algorithmica, vol. 82, no. 7, July 2020, pp. 1989–2005. EBSCOhost, https://doi.org/10.1007/s00453-020-00683-w.
APA
Feldmann, A. E., & Marx, D. (2020). The Parameterized Hardness of the k-Center Problem in Transportation Networks. Algorithmica, 82(7), 1989–2005. https://doi.org/10.1007/s00453-020-00683-w
Chicago
Feldmann, Andreas Emil, and Dániel Marx. 2020. “The Parameterized Hardness of the K-Center Problem in Transportation Networks.” Algorithmica 82 (7): 1989–2005. doi:10.1007/s00453-020-00683-w.