Maximum shortest path interdiction problem by upgrading edges on trees under Hamming distance (Q2230789)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Maximum shortest path interdiction problem by upgrading edges on trees under Hamming distance |
scientific article |
Statements
Maximum shortest path interdiction problem by upgrading edges on trees under Hamming distance (English)
0 references
28 September 2021
0 references
network interdiction problem
0 references
upgrading critical edges
0 references
shortest path
0 references
tree
0 references
Hamming distance
0 references
dynamic programming algorithm
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
