Minimizing the number of max-power users in ad-hoc wireless networks with minimum node degree requirements

DOI10.1016/j.ipl.2018.03.015zbMath1457.68218OpenAlexW2795004208MaRDI QIDQ1751413

Stefan Hoffmann, Thomas Kampermann, Egon Wanke

Publication date: 25 May 2018

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2018.03.015

zbMATH Keywords

approximation algorithmgraph theorycombinatorial problemsrange assignmentmax-power users

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)

Related Items

Parameterized Algorithms for Power-Efficiently Connecting Wireless Sensor Networks: Theory and Experiments ⋮ Approximation algorithm for receiver interference problem in dual power wireless sensor networks

Cites Work

• Power assignment in radio networks with two power levels
• Universality considerations in VLSI circuits
• Power consumption in packet radio networks
• Unnamed Item
• Unnamed Item
• Unnamed Item