Consider the TSP problem, in the symmetric and euclidean case. Consider the nearest neighbor heuristic. Is the approximation ratio some given constant? Can the approximation be made arbitrarily bad?
The worst example I can think of with pen and paper has an approximation rate of $\frac{3}{2}$, I am not sure if this can be made worse or not.