First, a description of what I'm talking about: given a finite metric space, what is the minimum number of non-overlapping circles of a given radius that can cover the area so that no other circles can be added?

I suppose my main question is, is this a known, named problem? If so, what is it usually called?

Also, is this the same problem as asking how few overlapping circles can cover the whole space?