Imanparast, M., & Hashemi, S. N. (2019). A linear time randomized approximation algorithm for Euclidean matching. The Journal of supercomputing, 75(5), 2648-2664. https://doi.org/10.1007/s11227-018-2673-2
Citace podle Chicago (17th ed.)Imanparast, Mahdi, a Seyed Naser Hashemi. "A Linear Time Randomized Approximation Algorithm for Euclidean Matching." The Journal of Supercomputing 75, no. 5 (2019): 2648-2664. https://doi.org/10.1007/s11227-018-2673-2.
Citace podle MLA (9th ed.)Imanparast, Mahdi, a Seyed Naser Hashemi. "A Linear Time Randomized Approximation Algorithm for Euclidean Matching." The Journal of Supercomputing, vol. 75, no. 5, 2019, pp. 2648-2664, https://doi.org/10.1007/s11227-018-2673-2.
Upozornění: Tyto citace jsou generovány automaticky. Nemusí být zcela správně podle citačních pravidel..