Kurt Mehlhorn, Guido Schäfer. A Heuristic for Dijkstra s Algorithm with Many Targets and Its Use in Weighted Matching Algorithms. In Friedhelm Meyer auf der Heide, editor, Algorithms - ESA 2001, 9th Annual European Symposium, Aarhus, Denmark, August 28-31, 2001, Proceedings. Volume 2161 of Lecture Notes in Computer Science, pages 242-253, Springer, 2001. [doi]
@inproceedings{MehlhornS01:0,
title = {A Heuristic for Dijkstra s Algorithm with Many Targets and Its Use in Weighted Matching Algorithms},
author = {Kurt Mehlhorn and Guido Schäfer},
year = {2001},
url = {http://link.springer.de/link/service/series/0558/bibs/2161/21610242.htm},
researchr = {https://researchr.org/publication/MehlhornS01%3A0},
cites = {0},
citedby = {0},
pages = {242-253},
booktitle = {Algorithms - ESA 2001, 9th Annual European Symposium, Aarhus, Denmark, August 28-31, 2001, Proceedings},
editor = {Friedhelm Meyer auf der Heide},
volume = {2161},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-42493-8},
}