Approximation algorithm for maximum flow network interdiction problem (Q3389526)
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: Approximation algorithm for maximum flow network interdiction problem |
scientific article; zbMATH DE number 7497000
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximation algorithm for maximum flow network interdiction problem |
scientific article; zbMATH DE number 7497000 |
Statements
23 March 2022
0 references
interdiction
0 references
approximation algorithm
0 references
network flow
0 references
minimum capacity cut
0 references
Approximation algorithm for maximum flow network interdiction problem (English)
0 references
0.8503652811050415
0 references
0.8494161367416382
0 references
0.819232702255249
0 references
0.816000759601593
0 references
0.809264063835144
0 references
