A heuristic for Dijkstra's algorithm with many targets and its use in weighted matching algorithms

DOI10.1007/s00453-002-1008-zzbMath1045.68148OpenAlexW1486649110MaRDI QIDQ1402219

Hisao Tamaki, Holger Bast, Kurt Mehlhorn, Guido Schäfer

Publication date: 19 August 2003

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-002-1008-z

zbMATH Keywords

Assignment problemDijkstra's algorithmSingle-source shortest-path problemWeighted bipartite matching problem

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)