Mehlhorn, Kurt Algorithms and Complexity, MPI for Informatics, Max Planck Society;
Schäfer, Guido Algorithms and Complexity, MPI for Informatics, Max Planck Society;
Mehlhorn, K., & Schäfer, G. (2001). A Heuristic for Dijkstra's Algorithm With Many Targets and its Use in Weighted Matching Algorithms. In Proceedings of the 9th Annual European Symposium on Algorithms (ESA-01) (pp. 242-253). Berlin, Germany: Springer.