On some polynomially solvable cases and approximate algorithms in the optimal communication tree construction problem

DOI10.1134/S1990478913020038MaRDI QIDQ5263800zbMATH OpenWikidataFDO

Authors A. I. Erzin, R. V. Plotnikov, Yuriy V. Shamardin

Publication date 17 July 2015

Published in Journal of Applied and Industrial Mathematics (Search for Journal in Brave)

zbMATH Keywords

spanning treeapproximate algorithmwireless communication network

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Algorithms for the optimum communication spanning tree problem
• Approximation algorithms for some optimum communication spanning tree problems
• A PTAS for the metric case of the optimum weighted source-destination communication spanning tree problem
• scientific article; zbMATH DE number 3891405
• Approximation algorithms for the optimal \(p\)-source communication spanning tree

Cited in

(10)

• Algorithms for the optimum communication spanning tree problem
• Parameterized Algorithms for Power-Efficient Connected Symmetric Wireless Sensor Networks
• Parameterized Algorithms for Power-Efficiently Connecting Wireless Sensor Networks: Theory and Experiments
• Communication tree problems
• Variable neighborhood search variants for min-power symmetric connectivity problem
• Multi-level regular coverings of the plane by disks
• Two-level hub Steiner trees
• Using VNS for the optimal synthesis of the communication tree in wireless sensor networks
• Approximation algorithms for some optimum communication spanning tree problems
• Approximation algorithms for the optimal \(p\)-source communication spanning tree

This page was built for publication: On some polynomially solvable cases and approximate algorithms in the optimal communication tree construction problem

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