On the Complexity of Computing Maximum and Minimum Min‐Cost‐Flows (Q6065863)
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 7775508
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the Complexity of Computing Maximum and Minimum Min‐Cost‐Flows |
scientific article; zbMATH DE number 7775508 |
Statements
On the Complexity of Computing Maximum and Minimum Min‐Cost‐Flows (English)
0 references
11 December 2023
0 references
approximation hardness
0 references
attacker-defender problem
0 references
bilevel programming
0 references
minimum cost flow
0 references
network interdiction
0 references
parametrized flow problems
0 references
0 references
0.8267564177513123
0 references
0.8140851259231567
0 references
0.808234691619873
0 references
0.7704941034317017
0 references
0.7689833045005798
0 references
