Algorithm 1 Linear Programming Relaxation Approach-based Offloading Algorithm
1:	Input: $N,M,K,{\alpha }_{nm},{\beta }_{nm},{\gamma }_{nm},C_{nk}^{\mathrm{UL}},C_{nk}^{\mathrm{DL}},\forall n\in \mathcal{N},\forall m\in \mathcal{M},\forall k\in \mathcal{K}$
2:	Output: $\mathit{a}$
3:	Solve (P2) to achieve ${\mathit{a}}^{*}$
4:	for $n=1,2,\dots ,N$ do
5:	for $m=1,2,\dots ,M$ do
6:	$k_{nm}^{*}=arg{max}_{k\in \mathcal{K}}{a}_{nmk}^{*}$;
7:	$a_{nmk}=0,\forall k\in \mathcal{K}\setminus \left\{k_{nm}^{*}\right\}$ and $a_{nm{k}_{nm}^{*}}=1$
8:	end for
9:	end for