Wireless Scheduling with Power Control
From MaRDI portal
Publication:3639259
DOI10.1007/978-3-642-04128-0_33zbMath1256.68020arXiv1010.3427OpenAlexW1505779571MaRDI QIDQ3639259
Publication date: 29 October 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1010.3427
Graph theory (including graph drawing) in computer science (68R10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25) Online algorithms; streaming algorithms (68W27)
Related Items (6)
Constant-approximation for optimal data aggregation with physical interference ⋮ Online capacity maximization in wireless networks ⋮ Convergence Time of Power-Control Dynamics ⋮ A note on uniform power connectivity in the physical signal to interference plus noise (SINR) model ⋮ Comparative study of approximation algorithms and heuristics for SINR scheduling with power control ⋮ When Algorithms for Maximal Independent Set and Maximal Matching Run in Sublinear Time
This page was built for publication: Wireless Scheduling with Power Control
