A better approximation algorithm for the budget prize collecting tree problem. (Q703233)
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 better approximation algorithm for the budget prize collecting tree problem. |
scientific article; zbMATH DE number 2125887
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A better approximation algorithm for the budget prize collecting tree problem. |
scientific article; zbMATH DE number 2125887 |
Statements
A better approximation algorithm for the budget prize collecting tree problem. (English)
0 references
11 January 2005
0 references
Approximation algorithms
0 references
subtree
0 references
0.850699782371521
0 references
0.8466527462005615
0 references
0.8443959355354309
0 references
0.8168288469314575
0 references
