On some polynomially solvable cases and approximate algorithms in the optimal communication tree construction problem
From MaRDI portal
Publication:5263800
DOI10.1134/S1990478913020038zbMath1324.90181WikidataQ62048759 ScholiaQ62048759MaRDI QIDQ5263800
R. V. Plotnikov, Yuriy V. Shamardin, Adil I. Erzin
Publication date: 17 July 2015
Published in: Journal of Applied and Industrial Mathematics (Search for Journal in Brave)
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (6)
Using VNS for the optimal synthesis of the communication tree in wireless sensor networks ⋮ Parameterized Algorithms for Power-Efficient Connected Symmetric Wireless Sensor Networks ⋮ Variable neighborhood search variants for min-power symmetric connectivity problem ⋮ Parameterized Algorithms for Power-Efficiently Connecting Wireless Sensor Networks: Theory and Experiments ⋮ Multi-Level Regular Coverings of the Plane by Disks ⋮ Two-level hub Steiner trees
This page was built for publication: On some polynomially solvable cases and approximate algorithms in the optimal communication tree construction problem
