A faster algorithm for the single source shortest path problem with few distinct positive lengths

James B. Orlin, Kamesh Madduri, K. Subramani, M. Williamson. A faster algorithm for the single source shortest path problem with few distinct positive lengths. J. Discrete Algorithms, 8(2):189-198, 2010. [doi]

Authors

James B. Orlin

This author has not been identified. Look up 'James B. Orlin' in Google

Kamesh Madduri

This author has not been identified. Look up 'Kamesh Madduri' in Google

K. Subramani

This author has not been identified. Look up 'K. Subramani' in Google

M. Williamson

This author has not been identified. Look up 'M. Williamson' in Google