A Shortest Path Algorithm for Graphs Featuring Transfer Costs at Their Vertices

摘要

This paper examines the problem of finding shortest paths in graphs that feature additional penalties - transfer costs - at their vertices. We propose a shortest path algorithm that can cope with these additional penalties without the need of first performing a graph expansion, which is the typical algorithmic strategy. While our method exhibits an inferior growth rate compared to existing approaches, we show that it is more efficient on sparse graphs.