On the complexity of an optimal routing tree problem (Q1123140)
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: On the complexity of an optimal routing tree problem |
scientific article; zbMATH DE number 4108532
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of an optimal routing tree problem |
scientific article; zbMATH DE number 4108532 |
Statements
On the complexity of an optimal routing tree problem (English)
0 references
1989
0 references
set packing
0 references
routing tree
0 references
decision tree
0 references
minimum cost
0 references
NP-complete
0 references
0.9258748
0 references
0.91968876
0 references
0 references
0.90922064
0 references
0.90922064
0 references
0 references
0 references
0.9084434
0 references
0.9055774
0 references
0.9055774
0 references
