Exact algorithms for the minimum power symmetric connectivity problem in wireless networks

DOI10.1016/j.cor.2004.04.017zbMath1071.90514OpenAlexW2133137640MaRDI 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

zbMATH Keywords

Integer programmingTelecommunicationsWireless networks

Mathematics Subject Classification ID

Integer programming (90C10) Communication networks in operations research (90B18) Deterministic network models in operations research (90B10)

Related Items (11)

Cutting-plane-based algorithms for two branch vertices related spanning tree problems ⋮ Submodular Formulations for Range Assignment Problems ⋮ Some Valid Inequalities for the Probabilistic Minimum Power Multicasting Problem ⋮ 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 ⋮ A linear programming-based evolutionary algorithm for the minimum power broadcast problem in wireless sensor networks ⋮ Minimum power multicasting in wireless networks under probabilistic node failures ⋮ Connection situations under uncertainty and cost monotonic solutions ⋮ Shared Multicast Trees in Ad Hoc Wireless Networks

Cites Work

• Unnamed Item
• Unnamed Item

This page was built for publication: Exact algorithms for the minimum power symmetric connectivity problem in wireless networks