A Heuristic for Dijkstra s Algorithm with Many Targets and Its Use in Weighted Matching Algorithms

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]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.