For every fixed ϵ, instances of size "n < N" can be solved by brute force, thereby showing an approximation ratio — existence of approximation algorithms with a guarantee — of "c" ∓ ϵ for every ϵ > 0.