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

From MaRDI portal
Revision as of 23:55, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references