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?
Sign up using Google
Sign up using Facebook
Sign up using Stack Exchange
1 year ago