Finding minimum cost data collection tree with aggregation (Q6971088)
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 8053246
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding minimum cost data collection tree with aggregation |
scientific article; zbMATH DE number 8053246 |
Statements
Finding minimum cost data collection tree with aggregation (English)
0 references
17 June 2025
0 references
data aggregation
0 references
routing tree
0 references
Dijkstra tree
0 references
bounded hop diameter tree
0 references
0 references
