Approximating the minmax rooted-tree cover in a tree (Q2380018)
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 5686451
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximating the minmax rooted-tree cover in a tree |
scientific article; zbMATH DE number 5686451 |
Statements
Approximating the minmax rooted-tree cover in a tree (English)
0 references
24 March 2010
0 references
approximation algorithms
0 references
graph algorithms
0 references
tree partitioning
0 references
tree covers
0 references
combinatorial problems
0 references
design of algorithms
0 references
0 references
0 references
0.9343865
0 references
0 references
0.92291486
0 references
0.92291486
0 references
0 references
0.9162191
0 references
0.9161446
0 references
0.9161446
0 references
0.9148191
0 references
0 references
