# Why is there no alpha-approximation algorithms for k-center problem where $\alpha<2$?

On page 39 of Design of Approximation Algorithms, the author argues this case with the dominating set problem.

I can't understand it. A dominating set problem is a special case of the $k$-center problem. How does the proof work?

-