Skip to main content
EURASIP Journal on Wireless Communications and Networking

Table 1 Asymptotic complexity comparison

From: On the feasibility of a channel-dependent scheduling for the SC-FDMA in 3GPP-LTE (mobile environment) based on a prioritized-bifacet Hungarian method

Algorithm

Complexity

Type

Greedy method

O(n2)

Quadratic

Binary Tree

Θ(log(n))

Logarithmic

PBHM

O((11n3 + 12n2 + 31n)/6)

-

Back to article page