An approximation algorithm for network flow interdiction with unit costs and two capacities (Q2056900)
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: An approximation algorithm for network flow interdiction with unit costs and two capacities |
scientific article; zbMATH DE number 7440736
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An approximation algorithm for network flow interdiction with unit costs and two capacities |
scientific article; zbMATH DE number 7440736 |
Statements
An approximation algorithm for network flow interdiction with unit costs and two capacities (English)
0 references
8 December 2021
0 references
network flow interdiction
0 references
two capacities
0 references
approximation algorithm
0 references
0.8928471803665161
0 references
0.8494161367416382
0 references
0.8249896764755249
0 references
