no code implementations • 6 Jan 2021 • Filippo Brunelli, Pierluigi Crescenzi, Laurent Viennot
Our algorithm can be used to solve several different minimum cost path problems in weighted point-availability time-dependent networks with a vast variety of cost definitions, and it can be easily modified in order to deal with the single destination Pareto problem.
Data Structures and Algorithms Networking and Internet Architecture
