A simplification of the double-sweep algorithm to solve the \(k\)-shortest path problem (Q5931724)

From MaRDI portal
Revision as of 19:41, 21 December 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 1591717
Language Label Description Also known as
English
A simplification of the double-sweep algorithm to solve the \(k\)-shortest path problem
scientific article; zbMATH DE number 1591717

    Statements

    A simplification of the double-sweep algorithm to solve the \(k\)-shortest path problem (English)
    0 references
    0 references
    0 references
    25 April 2001
    0 references
    0 references
    \(k\)-shortest path problem
    0 references
    network
    0 references