Partial inverse min-max spanning tree problem under the weighted bottleneck Hamming distance (Q6181336)
From MaRDI portal
scientific article; zbMATH DE number 7792560
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Partial inverse min-max spanning tree problem under the weighted bottleneck Hamming distance |
scientific article; zbMATH DE number 7792560 |
Statements
Partial inverse min-max spanning tree problem under the weighted bottleneck Hamming distance (English)
0 references
22 January 2024
0 references
partial inverse problem
0 references
min-max spanning tree
0 references
weighted bottleneck Hamming distance
0 references
strongly polynomial-time algorithm
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
