Genova, K., & Williamson, D. P. (2017). An Experimental Evaluation of the Best-of-Many Christofides’ Algorithm for the Traveling Salesman Problem. Algorithmica, 78(4), 1109-1130. https://doi.org/10.1007/s00453-017-0293-5
Citácia podle Chicago (17th ed.)Genova, Kyle, a David P. Williamson. "An Experimental Evaluation of the Best-of-Many Christofides’ Algorithm for the Traveling Salesman Problem." Algorithmica 78, no. 4 (2017): 1109-1130. https://doi.org/10.1007/s00453-017-0293-5.
Citácia podľa MLA (8th ed.)Genova, Kyle, a David P. Williamson. "An Experimental Evaluation of the Best-of-Many Christofides’ Algorithm for the Traveling Salesman Problem." Algorithmica, vol. 78, no. 4, 2017, pp. 1109-1130, https://doi.org/10.1007/s00453-017-0293-5.
Upozornenie: Tieto citáce sú generované automaticky. Nemusia byť úplne správne podľa citačných pravidiel..