K-means++ Question

Give a (possibly infinite) set X of input instances for K-means++ with the following property: for any p > 0 there is a set of points x ∈ X such that K-means++ with input x computes an optimum clustering (i.e. with minimum SSE), with probability at least 1 - p. Assume K ≥ 3 and number of points at least 30Give a (possibly infinite) set X of input instances for K-means++ with the following property: for any p > 0 there is a set of points x ∈ X such that K-means++ with input x computes an optimum clustering (i.e. with minimum SSE), with probability at least 1 - p. Assume K ≥ 3 and number of points at least 30

Give a (possibly infinite) set X of input instances for K-means++ with the following property: for any p > 0 there is a set of points x ∈ X such that K-means++ with input x computes an optimum clustering (i.e. with minimum SSE), with probability at least 1 - p. Assume K ≥ 3 and number of points at least 30