Inverse minimum cost flow problems under the weighted Hamming distance (Q992575)
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 5781811
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Inverse minimum cost flow problems under the weighted Hamming distance |
scientific article; zbMATH DE number 5781811 |
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
0 references
0 references
0 references
0.9700027704238892
0 references
0.9216195940971376
0 references
0.914730668067932
0 references
0.9127799272537231
0 references
0.8898398876190186
0 references
