Schäfer, Guido Algorithms and Complexity, MPI for Informatics, Max Planck Society;
2003-1-018 (Any fulltext), 11KB
Schäfer, G.(2003). A note on the smoothed complexity of the single-source shortest path problem (MPI-I-2003-1-018). Saarbrücken: Max-Planck-Institut für Informatik.