Post, Post, H.; Pijls, Pijls, W.H.L.M. - Faculteit der Economische Wetenschappen, Erasmus … - 2006
A widely known algorithm for ¯nding the shortest path in a network is Bidirectional A*. The version of bidirectional A* that is considered the most appropriate hitherto, uses so-called balanced heuristic estimates. In this paper, we focus on symmetric heuristic estimates. First, we show that...
