Better approximation algorithms for the maximum internal spanning tree problem (Q2350897)
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 6450389
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Better approximation algorithms for the maximum internal spanning tree problem |
scientific article; zbMATH DE number 6450389 |
Statements
Better approximation algorithms for the maximum internal spanning tree problem (English)
0 references
25 June 2015
0 references
approximation algorithm
0 references
spanning tree
0 references
0.99854576587677
0 references
0.91259104013443
0 references
0.9041734933853148
0 references
0.8842055201530457
0 references
