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
Created claim: Wikidata QID (P12): Q111520012, #quickstatements; #temporary_batch_1711196317277 |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1109/tc.2008.22 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2096088963 / rank | |||
Normal rank | |||
Latest revision as of 08:23, 30 July 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
