A. V. Aho, J. E. Hopcroft, and J. Ullman, The Design and Analysis of Computer Algorithms, 1974.

R. Bellman, On a routing problem, Quarterly of Applied Mathematics, vol.16, issue.1, pp.87-90, 1958.
DOI : 10.1090/qam/102435

P. Carstensen, The complexity of some problems in parametric linear and combinatorial programming, Mathematics Dept., U. of Michigan, 1983.

T. M. Chan, More algorithms for all-pairs shortest paths in weighted graphs, Proceedings of the thirty-ninth annual ACM symposium on Theory of computing , STOC '07, pp.590-598, 2007.
DOI : 10.1145/1250790.1250877

D. Coppersmith and S. Winograd, Matrix multiplication via arithmetic progressions, Proceedings of the nineteenth annual ACM conference on Theory of computing , STOC '87, pp.251-280, 1990.
DOI : 10.1145/28395.28396

E. W. Dijkstra, A note on two problems in connexion with graphs, Numerische Mathematik, vol.4, issue.1, pp.269-271, 1959.
DOI : 10.1007/BF01386390

R. W. Floyd, Algorithm 97: Shortest path, Communications of the ACM, vol.5, issue.6, p.345, 1962.
DOI : 10.1145/367766.368168

M. L. Fredman, New Bounds on the Complexity of the Shortest Path Problem, SIAM Journal on Computing, vol.5, issue.1, pp.49-60, 1976.
DOI : 10.1137/0205006

M. L. Fredman and R. E. Tarjan, Fibonacci heaps and their uses in improved network optimization algorithms, Journal of the ACM, vol.34, issue.3, pp.596-615, 1987.
DOI : 10.1145/28869.28874

D. Gusfield, Parametric Combinatorial Computing and a Problem of Program Module Distribution, Journal of the ACM, vol.30, issue.3, pp.551-563, 1983.
DOI : 10.1145/2402.322391

C. P. Van-hoesel, A. W. Kolen, A. H. Rinooy, and A. P. Wagelmans, Sensitivity analysis in combinatorial optimization: a bibliography, 1989.

D. B. Johnson, Efficient Algorithms for Shortest Paths in Sparse Networks, Journal of the ACM, vol.24, issue.1, pp.1-13, 1977.
DOI : 10.1145/321992.321993

N. Megiddo, Combinatorial Optimization with Rational Objective Functions, Mathematics of Operations Research, vol.4, issue.4, pp.414-424, 1979.
DOI : 10.1287/moor.4.4.414

K. Murty, Computational complexity of parametric linear programming, Mathematical Programming, vol.7, issue.1, pp.213-219, 1980.
DOI : 10.1007/BF01581642

R. M. Karp and J. B. Orlin, Parametric shortest path algorithms with an application to cyclic staffing, Discrete Applied Mathematics, vol.3, issue.1, pp.37-45, 1981.
DOI : 10.1016/0166-218X(81)90026-3

E. Nikolova, J. A. Kelner, M. Brand, and M. Mitzenmacher, Stochastic Shortest Paths Via Quasi-convex Maximization, Proceedings of the 14 th Annual European Symposium on Algorithms (ESA), pp.552-563, 2006.
DOI : 10.1007/11841036_50

N. E. Young, R. E. Tarjan, and J. B. Orlin, Faster parametric shortest path and minimum-balance algorithms, Networks, vol.6, issue.2, pp.205-221, 1991.
DOI : 10.1002/net.3230210206

U. Zwick, All pairs shortest paths using bridging sets and rectangular matrix multiplication, Journal of the ACM, vol.49, issue.3, pp.289-317, 2002.
DOI : 10.1145/567112.567114