Sciweavers

ESA
2009
Springer
149views Algorithms» more  ESA 2009»
13 years 11 months ago
Approximability of OFDMA Scheduling
In this paper, we study the complexity and approximability of the orthogonal frequency-division multiple access (OFDMA) scheduling problem with uniformly related communication chan...
Marcel Ochel, Berthold Vöcking