Improvement of shortest path of arborescent network in the case of Hamming distance (Q5322840)
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 5585183
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Improvement of shortest path of arborescent network in the case of Hamming distance |
scientific article; zbMATH DE number 5585183 |
Statements
22 July 2009
0 references
Hamming distance
0 references
shortest path
0 references
NP-hardness
0 references
0-1 integer programming
0 references
0.8713074922561646
0 references
0.8551631569862366
0 references
0.8525155782699585
0 references
0.8392155766487122
0 references
