Inverse minimum flow problem under the weighted sum-type Hamming distance (Q2012059)
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 6754395
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Inverse minimum flow problem under the weighted sum-type Hamming distance |
scientific article; zbMATH DE number 6754395 |
Statements
Inverse minimum flow problem under the weighted sum-type Hamming distance (English)
0 references
27 July 2017
0 references
minimum flow
0 references
minimum cut
0 references
inverse problem
0 references
Hamming distance
0 references
strongly polynomial algorithm
0 references
0 references
0 references
0.9305397868156432
0 references
0.928221583366394
0 references
0.914730668067932
0 references
0.8964966535568237
0 references
