Approximating the maximum internal spanning tree problem (Q1034535)
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 5626895
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximating the maximum internal spanning tree problem |
scientific article; zbMATH DE number 5626895 |
Statements
Approximating the maximum internal spanning tree problem (English)
0 references
6 November 2009
0 references
approximation algorithm
0 references
spanning tree leaves
0 references
Hamiltonian path
0 references
0.9531832933425904
0 references
0.91259104013443
0 references
0.9125167727470398
0 references
0.8910551071166992
0 references
