Almost linear time algorithms for minsum \(k\)-sink problems on dynamic flow path networks (Q5925664)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7666350
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Almost linear time algorithms for minsum \(k\)-sink problems on dynamic flow path networks |
scientific article; zbMATH DE number 7666350 |
Statements
Almost linear time algorithms for minsum \(k\)-sink problems on dynamic flow path networks (English)
0 references
21 March 2023
0 references
dynamic flow networks
0 references
facility location problems
0 references
minimum k-link path problem
0 references
persistent data structures
0 references
