Inverse minimum cost flow problems under the weighted Hamming distance (Q992575): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 21:26, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Inverse minimum cost flow problems under the weighted Hamming distance |
scientific article |
Statements
Inverse minimum cost flow problems under the weighted Hamming distance (English)
0 references
9 September 2010
0 references
network flows
0 references
inverse problem
0 references
Hamming distance
0 references
APX-hard
0 references
strongly polynomial algorithm
0 references
