Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

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?

share|improve this question

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.