Covering a tree with rooted subtrees -- parameterized and approximation algorithms (Q4608073)
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: Covering a tree with rooted subtrees -- parameterized and approximation algorithms |
scientific article; zbMATH DE number 6850486
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Covering a tree with rooted subtrees -- parameterized and approximation algorithms |
scientific article; zbMATH DE number 6850486 |
Statements
15 March 2018
0 references
approximation schemes
0 references
fixed-parameter tractable
0 references
integer programming
0 references
scheduling
0 references
0.7869725823402405
0 references
0.7818116545677185
0 references
0.756283700466156
0 references
0.7559165358543396
0 references
0.7522047758102417
0 references
