Minmax subtree cover problem on cacti (Q2495907)
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: Minmax subtree cover problem on cacti |
scientific article; zbMATH DE number 5037795
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minmax subtree cover problem on cacti |
scientific article; zbMATH DE number 5037795 |
Statements
Minmax subtree cover problem on cacti (English)
0 references
30 June 2006
0 references
approximation algorithm
0 references
cactus
0 references
graph partition
0 references
NP-hard
0 references
tree
0 references
vehicle routing
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8889531
0 references
0 references
0 references
0.88368136
0 references
0.88368136
0 references
0.8834381
0 references
0.88103366
0 references
0 references
0.87907416
0 references
