Publisher
Springer Nature Switzerland
Reference29 articles.
1. Bagaa, M., Challal, Y., Ksentini, A., Derhab, A., Badache, N.: Data aggregation scheduling algorithms in wireless sensor networks: solutions and challenges. IEEE Commun. Surv. Tutor. 16, 1339–1367 (2014)
2. Beier, R., Sibeyn, J.F.: A powerful heuristic for telephone gossiping. In: Proceedings of 17th International Colloquium on Structural Information & Communication Complexity (SIROCCO 2000), pp. 17–36 (2000)
3. Lecture Notes in Computer Science;X Chen,2005
4. Edmonds, J.: Optimum branchings. J. Res. Natl. Bureau Stand. B 71, 233–240 (1967)
5. Erzin, A., Pyatkin, A.: Convergecast scheduling problem in case of given aggregation tree: the complexity status and some special cases. In: Proceedings of 10th International Symposium on Communication Systems Networks and Digital Signal Processing (CSNDSP), pp. 1–6. IEEE (2016). https://doi.org/10.1109/CSNDSP.2016.7574007