R-approximable problem

A language or problem $L$ is said to be $R$-approximable if there is some polynomial-time approximation algorithm $M$ such that $R_M(w)\le R$ for all $w\in {\Sigma }^{\ast }$.

$$C_{\text{approx}}\le R\times C_{\text{global}}$$