Inverse min-max spanning tree problem under the weighted sum-type Hamming distance (Q924129)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Inverse min-max spanning tree problem under the weighted sum-type Hamming distance |
scientific article; zbMATH DE number 5279821
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Inverse min-max spanning tree problem under the weighted sum-type Hamming distance |
scientific article; zbMATH DE number 5279821 |
Statements
Inverse min-max spanning tree problem under the weighted sum-type Hamming distance (English)
0 references
28 May 2008
0 references
min-max spanning tree
0 references
inverse problem
0 references
Hamming distance
0 references
strongly polynomial algorithms
0 references
0 references
0.9997800588607788
0 references
0.9199916124343872
0 references
0.9116498231887816
0 references
0.9069873094558716
0 references
