Approximating the maximum internal spanning tree problem via a maximum path-cycle cover (Q2942652)
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 6480935
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximating the maximum internal spanning tree problem via a maximum path-cycle cover |
scientific article; zbMATH DE number 6480935 |
Statements
Approximating the Maximum Internal Spanning Tree Problem via a Maximum Path-Cycle Cover (English)
0 references
11 September 2015
0 references
complexity
0 references
approximation
0 references
maximum internal spanning tree
0 references
0.8835479021072388
0 references
0.8575251698493958
0 references
0.8552610278129578
0 references
0.8413901329040527
0 references
