Resumen de Un algoritmo óptimo para el cálculo del circuito de latencia mínima en un grafo camino con pesos

Pedro Jodrá Esteban, Alfredo García Olaverri, Javier Tejel

• Given a path graph with nodes {1, . . .,N}, we provide an È(N)-algorithm for finding the minimum weighted latency tour starting at i, where i is an arbitrarily chosen node. The complexity of the algorithm improves the O(N2)-complexity of the best known algorithm for this problem.