Assertion: metric space | /r/HasProperty | x \displaystyle \mathcal x
Facets:
Source sentences:
text: \mathcal {X}}} ,belonging to a metric space ( X {\displaystyle {\mathcal {X}}} ,d), the greedy K-center algorithm computes a set K of k centers, such that K is a 2-approximation to the optimal k-center clustering of V.