Hardness and approximation for network flow interdiction (Q4638580)
From MaRDI portal
!
WARNING
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 6865264
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Hardness and approximation for network flow interdiction |
scientific article; zbMATH DE number 6865264 |
Statements
Hardness and approximation for network flow interdiction (English)
0 references
27 April 2018
0 references
interdiction
0 references
approximation algorithms
0 references
hardness of approximation
0 references
network flow
0 references
densest \(k\)-subgraph
0 references
multiobjective optimization
0 references
0.9035984
0 references
0.8997422
0 references
0.89936554
0 references
0.88698816
0 references
0.88513196
0 references
0 references
0.8750712
0 references
0.8735987
0 references
