A \((B + 1)\)-approximation for network flow interdiction with unit costs (Q6558673)
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: A (B + 1)-approximation for network flow interdiction with unit costs |
scientific article; zbMATH DE number 7868437
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A \((B + 1)\)-approximation for network flow interdiction with unit costs |
scientific article; zbMATH DE number 7868437 |
Statements
A \((B + 1)\)-approximation for network flow interdiction with unit costs (English)
0 references
20 June 2024
0 references
network flow interdiction
0 references
approximation algorithm
0 references
interdiction problem
0 references
0 references
0 references
0.9560471773147584
0 references
0.8835532665252686
0 references
0.8375923037528992
0 references
0.8004665374755859
0 references
