I am trying to understand the following text which defines a greedy algorithm for center selection problem:
It would put the first center at the best possible location for a single center, then keep adding centers so as to reduce the covering radius, each time, by as much as possible. It turns out that this approach is a bit too simplistic to be effective: there are cases where it can lead to very bad solutions.
Kleinberg, Jon. Algorithm Design (p. 607). Pearson Education. Kindle Edition.
Is the term "single center" typo for "single site"?
Some body please guide me how by adding centers we can reduce the covering radius?