Comparative study of approximation algorithms and heuristics for SINR scheduling with power control

DOI10.1016/j.tcs.2014.05.014zbMath1360.68898OpenAlexW1971621207MaRDI QIDQ742414

Arie M. C. A. Koster, Berthold Vöcking, Lukas Belke, Thomas Kesselheim

Publication date: 18 September 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2014.05.014

zbMATH Keywords

simulationsapproximation algorithmsSINRpower controllink scheduling

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)

Related Items (1)

Limitations of current wireless link scheduling algorithms

Cites Work

• Unnamed Item
• Unnamed Item
• Approximation Algorithms for Wireless Link Scheduling with Flexible Data Rates
• Wireless Scheduling with Power Control
• The capacity of wireless networks
• Oblivious interference scheduling
• The Power of Non-Uniform Wireless Power

This page was built for publication: Comparative study of approximation algorithms and heuristics for SINR scheduling with power control