How to Trim an MST: A 2-Approximation Algorithm for Minimum Cost Tree Cover (Q3613779)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5528741
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | How to Trim an MST: A 2-Approximation Algorithm for Minimum Cost Tree Cover |
scientific article; zbMATH DE number 5528741 |
Statements
How to Trim an MST: A 2-Approximation Algorithm for Minimum Cost Tree Cover (English)
0 references
12 March 2009
0 references
0.9929154
0 references
0.8764585
0 references
0.8747169
0 references
0.8747169
0 references
0.86669356
0 references
0 references
0.85931706
0 references
0.85931706
0 references
0.8584089
0 references
