Weighted inverse minimum spanning tree problems under Hamming distance (Q1774530)
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: Weighted inverse minimum spanning tree problems under Hamming distance |
scientific article; zbMATH DE number 2168268
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Weighted inverse minimum spanning tree problems under Hamming distance |
scientific article; zbMATH DE number 2168268 |
Statements
Weighted inverse minimum spanning tree problems under Hamming distance (English)
0 references
17 May 2005
0 references
minimum spanning tree
0 references
inverse problem
0 references
strongly polynomial algorithm
0 references
0.9277519583702089
0 references
0.924679398536682
0 references
0.923843801021576
0 references
0.909462869167328
0 references
0.9037214517593384
0 references
