Minimax problem of suppressing a communication network (Q822223)
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 7398357
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimax problem of suppressing a communication network |
scientific article; zbMATH DE number 7398357 |
Statements
Minimax problem of suppressing a communication network (English)
0 references
21 September 2021
0 references
Ford and Fulkerson maximum flow problem
0 references
maximum flow minimization problem
0 references
reduction of minimax problem to sequence of equivalent problems
0 references
equivalent problems on Boolean lattice
0 references
submodular programming techniques
0 references
0.89371675
0 references
0.8622818
0 references
0.8610681
0 references
0.8596074
0 references
0.84603524
0 references
0.84511757
0 references
0.8413508
0 references
