1. Bellman, R.: On a routing problem. Quarterly in Applied Mathematics 16(1), 87–90 (1958)
2. Carstensen, P.J.: Parametric cost shortest chain problem, Bellcore (manuscript) (1984)
3. Cheong, O., Haverkort, H., Lee, M.: Computing a minimum-dilation spanning tree is NP-hard. In: Proc. 13th Australasian Symp. Theory of Computing, pp. 15–24 (2007)
4. Dasdan, A., Irani, S., Gupta, R.: An experimental study of minimum mean cycle algorithms. Technical report, University of California, Irvine (1998)
5. de Berg, M., van Kreveld, M., Overmars, M., Schwarzkopf, O.: Computational Geometry: Algorithms and Applications, 2nd edn. Springer, Heidelberg (1998)