Finding minimum cost data collection tree with aggregation

DOI10.1007/S10957-025-02715-3MaRDI QIDQ6971088zbMATH OpenFDO

Authors Ihor Rusnak, Michael Segal

Publication date 17 June 2025

Published in Journal of Optimization Theory and Applications (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S10957-025-02715-3

zbMATH Keywords

bounded hop diameter treedata aggregationDijkstra treerouting tree

Mathematics Subject Classification ID

Wireless sensor networks as related to computer science (68M18) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)

Cites work

• Ad-hoc, mobile, and wireless networks. Second international conference ADHOC-NOW 2003, Montreal, Canada, October 8--10, 2003. Proceedings.
• Bounded-hops power assignment in ad hoc wireless networks
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• On the Construction of Data Aggregation Tree with Minimum Energy Cost in Wireless Sensor Networks: NP-Completeness and Approximation Algorithms
• Performance Guarantees for Approximation Algorithms Depending on Parametrized Triangle Inequalities

This page was built for publication: Finding minimum cost data collection tree with aggregation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6971088)