Almost linear time algorithms for minsum \(k\)-sink problems on dynamic flow path networks (Q5918293)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Almost linear time algorithms for minsum k-sink problems on dynamic flow path networks |
scientific article; zbMATH DE number 7361602
| 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 7361602 |
Statements
Almost linear time algorithms for minsum \(k\)-sink problems on dynamic flow path networks (English)
0 references
22 June 2021
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
0.9110692143440248
0 references
0.8963364958763123
0 references
0.8945543766021729
0 references
0.884837806224823
0 references
0.8822889924049377
0 references
