R. Guerin and A. Orda, “Computing Shortest Paths for Any Number of Hops.” IEEE/ACM Transactions on Networking, Vol. 10, No. 5, October 2002