On the inverse maximum perfect matching problem under the bottleneck-type Hamming distance (Q4626658)
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 7030862
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the inverse maximum perfect matching problem under the bottleneck-type Hamming distance |
scientific article; zbMATH DE number 7030862 |
Statements
28 February 2019
0 references
inverse problem
0 references
Hamming distance
0 references
perfect matching
0 references
binary search
0 references
On the inverse maximum perfect matching problem under the bottleneck-type Hamming distance (English)
0 references
0.9477508664131165
0 references
0.875342607498169
0 references
0.8122239708900452
0 references
0.8058785200119019
0 references
