Almost linear time algorithms for minsum \(k\)-sink problems on dynamic flow path networks (Q5918293)

From MaRDI portal
Revision as of 01:39, 26 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 7361602
Language Label Description Also known as
English
Almost linear time algorithms for minsum \(k\)-sink problems on dynamic flow path networks
scientific article; zbMATH DE number 7361602

    Statements

    Almost linear time algorithms for minsum \(k\)-sink problems on dynamic flow path networks (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    22 June 2021
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    dynamic flow networks
    0 references
    facility location problems
    0 references
    minimum \(k\)-link path problem
    0 references
    persistent data structures
    0 references
    0 references
    0 references