Minimum cost dynamic flows: the series-parallel case (Q5101426)
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 7577902
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimum cost dynamic flows: the series-parallel case |
scientific article; zbMATH DE number 7577902 |
Statements
Minimum cost dynamic flows: The series-parallel case (English)
0 references
30 August 2022
0 references
dynamic network
0 references
feasible dynamic flow
0 references
NP-hard
0 references
greedy algorithm
0 references
0.9955571293830872
0 references
0.8652979135513306
0 references
0.8284637928009033
0 references
