Constructing a Message-Pruning Tree with Minimum Cost for Tracking Moving Objects in Wireless Sensor Networks Is NP-Complete and an Enhanced Data Aggregation Structure (Q4589597): Difference between revisions
From MaRDI portal
Set profile property. |
Created claim: Wikidata QID (P12): Q111520012, #quickstatements; #temporary_batch_1711196317277 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q111520012 / rank | |||
Normal rank | |||
Revision as of 14:22, 23 March 2024
scientific article; zbMATH DE number 6805728
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Constructing a Message-Pruning Tree with Minimum Cost for Tracking Moving Objects in Wireless Sensor Networks Is NP-Complete and an Enhanced Data Aggregation Structure |
scientific article; zbMATH DE number 6805728 |
Statements
Constructing a Message-Pruning Tree with Minimum Cost for Tracking Moving Objects in Wireless Sensor Networks Is NP-Complete and an Enhanced Data Aggregation Structure (English)
0 references
10 November 2017
0 references
