Minimum-cost dynamic flows: The series-parallel case (Q4474291)
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 2081223
| 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 2081223 |
Statements
Minimum-cost dynamic flows: The series-parallel case (English)
0 references
4 August 2004
0 references
minimum-cost flow
0 references
dynamic network flow
0 references
greedy algorithm
0 references
two-terminal series parallel networks
0 references
0.9955571293830872
0 references
0.8651621341705322
0 references
0.8375336527824402
0 references
0.831839919090271
0 references
