Approximating the minimum-cost maximum flow is P-complete (Q1198087): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / cites work | |||
| Property / cites work: The maximum flow problem is log space complete for P / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4385522 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3796746 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Approximating linear programming is log-space complete for P / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3484351 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4035662 / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0020-0190(92)90229-o / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1969990079 / rank | |||
Normal rank | |||
Latest revision as of 11:08, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximating the minimum-cost maximum flow is P-complete |
scientific article |
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
