Approximation Solutions for Time-Varying Shortest Path Problem

Abstract

Abstract. Time-varying network optimization problems have tradition-ally been solved by specialized algorithms. These algorithms have NP-complement time complexity. This paper considers the time-varying short-est path problem, in which can be optimally solved in O(T(m + n) ) time,where T is a given integer. For this problem with arbitrary waiting times,we propose an approximation algorithm, which can solve the problem withO(T(m+n)/ k ) time complexity such that evaluates only a subset of the valuesfor t = {0, 1, . . . , T}.