There exists a minimization problem such that (i) assuming P = NP, there is no polynomial-time 1-approximation algorithm for the problem; and (ii) for any constant =C7=AB > 0, there is a polynomial-time (1 + =C7=AB)-approximation algorithm for the problem