Skip to main content

Table 2 Complexity of algorithms

From: A low-complexity cell clustering algorithm in dense small cell networks

Algorithm

Quantitative

Order

 

representation

representation

Exhaustive

Eq. (29)

\(\mathcal {O} \left (L^{2} N^{\left (L \left (N - 1 \right) + 1 \right)} \right)\)

algorithm

  

Greedy

Eq. (33)

\(\mathcal {O} \left (L^{2} N^{L} \right)\)

algorithm

  

Proposal

Eq. (38)

\(\mathcal {O} \left (N^{3} L^{2} + N^{2} L^{3} \right)\)