On the Construction of Data Aggregation Tree with Minimum Energy Cost in Wireless Sensor Networks: NP-Completeness and Approximation Algorithms

DOI10.1109/TC.2015.2512862zbMath1360.94501arXiv1402.6457OpenAlexW2343543015MaRDI QIDQ2985262

Tung-Wei Kuo, Kate Ching-Ju Lin, Ming-Jer Tsai

Publication date: 16 May 2017

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1402.6457

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Applications of graph theory to circuits and networks (94C15) Approximation algorithms (68W25)

This page was built for publication: On the Construction of Data Aggregation Tree with Minimum Energy Cost in Wireless Sensor Networks: NP-Completeness and Approximation Algorithms