A 2-approximation algorithm for finding a spanning tree with maximum number of leaves (Q513269)
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 6691857
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A 2-approximation algorithm for finding a spanning tree with maximum number of leaves |
scientific article; zbMATH DE number 6691857 |
Statements
A 2-approximation algorithm for finding a spanning tree with maximum number of leaves (English)
0 references
3 March 2017
0 references
approximation algorithm
0 references
graphs
0 references
optimization
0 references
0 references
0 references
0 references
0 references
0.8937262892723083
0 references
0.8732519745826721
0 references
0.8714420795440674
0 references
