A 2.5-factor approximation algorithm for the \(k\)-MST problem (Q293204)
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: A 2.5-factor approximation algorithm for the k-MST problem |
scientific article; zbMATH DE number 6590674
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A 2.5-factor approximation algorithm for the \(k\)-MST problem |
scientific article; zbMATH DE number 6590674 |
Statements
A 2.5-factor approximation algorithm for the \(k\)-MST problem (English)
0 references
9 June 2016
0 references
approximation algorithms
0 references
\(k\)-MST problem
0 references
0.8973791599273682
0 references
0.8926483988761902
0 references
