Constrained inverse min-max spanning tree problems under the weighted Hamming distance (Q1029667): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 02:57, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Constrained inverse min-max spanning tree problems under the weighted Hamming distance |
scientific article |
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
