In the literature, an approximation ratio for a maximization (minimization) problem of "c" - ϵ (min: "c" + ϵ) means that the algorithm has an approximation ratio of "c" ∓ ϵ for arbitrary ϵ > 0 but that the ratio has not (or cannot) be shown for ϵ = 0.