Constrained inverse min-max spanning tree problems under the weighted Hamming distance (Q1029667)
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: Constrained inverse min-max spanning tree problems under the weighted Hamming distance |
scientific article; zbMATH DE number 5577738
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Constrained inverse min-max spanning tree problems under the weighted Hamming distance |
scientific article; zbMATH DE number 5577738 |
Statements
Constrained inverse min-max spanning tree problems under the weighted Hamming distance (English)
0 references
13 July 2009
0 references
The authors consider the constrained inverse min-max spanning tree problems under the weighted Hamming distance. Three models are studied: the problem under the bottleneck-type weighted Hamming distance and two mixed types of problems. The authors present combinatorial algorithms for these problems that all run in strongly polynomial time.
0 references
min-max spanning tree
0 references
inverse problems
0 references
Hamming distance
0 references
strongly polynomial algorithms
0 references
0 references
