Exact algorithms for the minimum power symmetric connectivity problem in wireless networks
From MaRDI portal
Publication:1781561
DOI10.1016/j.cor.2004.04.017zbMath1071.90514MaRDI QIDQ1781561
Luca Maria Gambardella, Roberto Montemanni
Publication date: 27 June 2005
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2004.04.017
90C10: Integer programming
90B18: Communication networks in operations research
90B10: Deterministic network models in operations research
Related Items
Parameterized Algorithms for Power-Efficient Connected Symmetric Wireless Sensor Networks, Parameterized Algorithms for Power-Efficiently Connecting Wireless Sensor Networks: Theory and Experiments, Wireless multicasting under probabilistic node failures: a heuristic approach, Connectivity-and-hop-constrained design of electricity distribution networks, Minimum power multicasting in wireless networks under probabilistic node failures, A linear programming-based evolutionary algorithm for the minimum power broadcast problem in wireless sensor networks, Connection situations under uncertainty and cost monotonic solutions, Cutting-plane-based algorithms for two branch vertices related spanning tree problems, Shared Multicast Trees in Ad Hoc Wireless Networks, Submodular Formulations for Range Assignment Problems, Some Valid Inequalities for the Probabilistic Minimum Power Multicasting Problem
Cites Work