A \(2+\varepsilon\) approximation algorithm for the \(k\)-MST problem (Q2492706)
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+ approximation algorithm for the k-MST problem |
scientific article; zbMATH DE number 5032450
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A \(2+\varepsilon\) approximation algorithm for the \(k\)-MST problem |
scientific article; zbMATH DE number 5032450 |
Statements
A \(2+\varepsilon\) approximation algorithm for the \(k\)-MST problem (English)
0 references
14 June 2006
0 references
Approximation algorithm
0 references
Primal-Dual schema
0 references
0 references
0.9968079924583436
0 references
0.9425084590911864
0 references
0.8883165717124939
0 references
