Capacitated partial inverse maximum spanning tree under the weighted Hamming distance (Q2279743)
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: Capacitated partial inverse maximum spanning tree under the weighted Hamming distance |
scientific article; zbMATH DE number 7143371
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Capacitated partial inverse maximum spanning tree under the weighted Hamming distance |
scientific article; zbMATH DE number 7143371 |
Statements
Capacitated partial inverse maximum spanning tree under the weighted Hamming distance (English)
0 references
13 December 2019
0 references
partial inverse combinatorial optimization problem
0 references
spanning tree
0 references
Hamming distance
0 references
computational complexity
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.9184747934341432
0 references
0.8723085522651672
0 references
0.8691337704658508
0 references
0.86623615026474
0 references
0.8659204244613647
0 references
