In K-means clustering, the algorithm iteratively updates the cluster centers until the within-cluster sum of squares is ________.

In K-means clustering, the algorithm aims to minimize the within-cluster sum of squares (WCSS). This represents the total variance within clusters. As the algorithm iteratively updates the cluster centers, the goal is to minimize the WCSS, making "Minimized" the correct option.