Bringmann, Karl Algorithms and Complexity, MPI for Informatics, Max Planck Society;
arXiv:1306.3030.pdf (Preprint), 242KB
Bringmann, K., Engels, C., Manthey, B., & Rao, R. B. V. (2013). Random Shortest Paths: Non-Euclidean Instances for Metric Optimization Problems. Retrieved from http://arxiv.org/abs/1306.3030.