computational complexity; computational geometry; pattern clustering; polynomial time approximation schemes; geometric k-clustering; data point clustering; distance function; data set partitioning; NP-hard problem; high dimensional geometry; binary cube; Hamming distance; k-median problem
(xsd:string)