Algorithm that approximates solutions to the travellng salesman problem on a metric space, guaranteeing that its solutions will be within 1½ of the optimal solution length; discovered by Nicos Christofides in 1976
алгоритм поиска приближённых решений задачи коммивояжёра для случаев (ru)
algorithm that approximates solutions to the travellng salesman problem on a metric space, guaranteeing that its solutions will be within 1½ of the optimal solution length; discovered by Nicos Christofides in 1976 (en)
algoritmo por proksimuma solvo de la kolportista problemo sur metrika spaco, kiu garantias ke la proksimuma solvo kuŝas en faktoro 1½ de la optimuma solvo; inventita de Nikos Ĥristofidis en 1976 (eo)