Minimum cost flow algorithms for series-parallel networks (Q1061597)
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: Minimum cost flow algorithms for series-parallel networks |
scientific article; zbMATH DE number 3912064
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimum cost flow algorithms for series-parallel networks |
scientific article; zbMATH DE number 3912064 |
Statements
Minimum cost flow algorithms for series-parallel networks (English)
0 references
1985
0 references
It is shown that an acyclic multigraph with a single source and a single sink is series parallel if and only if for arbitrary linear cost functions and arbitrary capacities the corresponding minimum cost flow problem can be solved by a greedy algorithm. Furthermore, for networks of this type with m edges and n vertices, two \(O(mn+m \log m)\)-algorithms are presented. One of them is based on the greedy scheme.
0 references
acyclic multigraph
0 references
single source
0 references
single sink
0 references
series parallel
0 references
minimum cost flow problem
0 references
greedy algorithm
0 references
