Worst-case behavior of the MVCA heuristic for the minimum labeling spanning tree problem (Q1886801)
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: Worst-case behavior of the MVCA heuristic for the minimum labeling spanning tree problem |
scientific article; zbMATH DE number 2116854
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Worst-case behavior of the MVCA heuristic for the minimum labeling spanning tree problem |
scientific article; zbMATH DE number 2116854 |
Statements
Worst-case behavior of the MVCA heuristic for the minimum labeling spanning tree problem (English)
0 references
19 November 2004
0 references
Algorithm
0 references
NP-hard
0 references
Spanning trees
0 references
Linear programming
0 references
0.8820515
0 references
0.87246656
0 references
0.87141216
0 references
0.87104094
0 references
0.8698114
0 references
0.8679258
0 references
0.86569357
0 references
