In this paper we present a novel approach to solve the Time-Dependent Nearest Server problem, i.e., the problem of finding a service provider that, given a requesting user, can reach the user's geographical location as early as possible while taking into account tra c conditions. We also present a reduction of the above problem to the fastest-path problem to prove the correctness and bound the time complexity of our approach. In the experimental evaluation we compare our approach with respect

more »

... the state-of-art, and show its e↵ectiveness in terms of accuracy and performance.