@inproceedings{e6827813e886468bb9a7427984cbca5a,
title = "Constructive Heuristics for Min-Power Bounded-Hops Symmetric Connectivity Problem",
abstract = "We consider a problem of constructing an energy-efficient bounded diameter communication spanning tree when the vertices are located on a plane, and the energy required to transmit a message between a pair of vertices is proportional to the squared distance between them. For this NP-hard problem, we have developed several approximate heuristic algorithms. The results of a posteriori analysis of solutions constructed by the proposed algorithms are presented",
keywords = "Approximation algorithms, Bounded hops, Energy efficiency, Symmetric connectivity",
author = "Roman Plotnikov and Adil Erzin",
year = "2019",
doi = "10.1007/978-3-030-33394-2_31",
language = "English",
isbn = "9783030333935",
volume = "1090",
series = "Communications in Computer and Information Science",
publisher = "Springer International Publishing AG",
pages = "390--407",
editor = "Igor Bykadorov and Vitaly Strusevich and Tatiana Tchemisova",
booktitle = "Mathematical Optimization Theory and Operations Research - 18th International Conference, MOTOR 2019, Revised Selected Papers",
address = "Switzerland",
note = "18th International Conference on Mathematical Optimization Theory and Operations Research, MOTOR 2019 ; Conference date: 08-07-2019 Through 12-07-2019",
}