Fast and fine quickest path algorithm
A novel quickest path algorithm is proposed. The algorithm runs in O(r(m+nlogn)) O ( r ( m + n log n ) ) time and uses O(m+n) O ( m + n ) space. It is a ratio-labeling algorithm working as a Dijkstra-like method. The method enumerates only supported efficient paths. Computational tests show that the algorithm performs very well.
quickest path or in telecommunications supported non-dominated path