On the complexity of an optimal routing tree problem (Q1123140): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (3 intermediate revisions by 2 users not shown) | |||
| Property / author | |||
| Property / author: Ding-Zhu Du / rank | |||
| Property / author | |||
| Property / author: Ker-I. Ko / rank | |||
| Property / author | |||
| Property / author: Ding-Zhu Du / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Ker-I. Ko / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf02006188 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2016093718 / rank | |||
Normal rank | |||
Latest revision as of 10:50, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of an optimal routing tree problem |
scientific article |
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
