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

From MaRDI portal
Revision as of 04:13, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
A heuristic for Dijkstra's algorithm with many targets and its use in weighted matching algorithms
scientific article

    Statements

    A heuristic for Dijkstra's algorithm with many targets and its use in weighted matching algorithms (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    19 August 2003
    0 references
    0 references
    Single-source shortest-path problem
    0 references
    Dijkstra's algorithm
    0 references
    Weighted bipartite matching problem
    0 references
    Assignment problem
    0 references