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 this page instead for the normal view: A 2-approximation algorithm for finding a spanning tree with maximum number of leaves |
scientific article; zbMATH DE number 6691857
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
