2009
DOI: 10.1007/978-3-642-04128-0_35
|View full text |Cite
|
Sign up to set email alerts
|

Approximability of OFDMA Scheduling

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 10 publications
0
1
0
Order By: Relevance
“…Sub-problem S2 is the traditional MA optimization, though it is proved to be NPcomplete [43,44]. Among all the existing algorithms for MA optimization, the dynamic programming based resource allocation (DPRA) [42] is a recent method with low complexity and good performance.…”
Section: Algorithm 21 Single User Frequency Adapting Algorithm (Sufa)mentioning
confidence: 99%
“…Sub-problem S2 is the traditional MA optimization, though it is proved to be NPcomplete [43,44]. Among all the existing algorithms for MA optimization, the dynamic programming based resource allocation (DPRA) [42] is a recent method with low complexity and good performance.…”
Section: Algorithm 21 Single User Frequency Adapting Algorithm (Sufa)mentioning
confidence: 99%