I am trying to understand a book material related to greedy approach for determining a center for a single site
Main Question or Discussion Point
I have underlined the word single center, is this single center or single site? What is coverng radius? Why it can have bad solution?Algorithm We now discuss greedy algorithms for this problem. As before, the meaning of “greedy” here is necessarily a little fuzzy; essentially,
we consider algorithms that select sites one by one in a myopic fashion—that is, choosing each without explicitly considering where the remaining sites will go.
Probably the simplest greedy algorithm would work as follows. 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.
Somebody please guide me.