Approximating the minimum-cost maximum flow is P-complete (Q1198087)
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 92137
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximating the minimum-cost maximum flow is P-complete |
scientific article; zbMATH DE number 92137 |
Statements
Approximating the minimum-cost maximum flow is P-complete (English)
0 references
16 January 1993
0 references
\(P\)-complete
0 references
minimum-cost flow
0 references
maximum flow
0 references
