It was proposed in 2007 by David Arthur and Sergei Vassilvitskii, as an approximation algorithm for the NP-hard k-means problem—a way of avoiding the sometimes poor clusterings found by the standard k-means algorithm.
David Arthur i Sergei Vassilvitskii su ga predstavili 2007. godine, kao približni algoritam za NP-težak k-means problem - način na koji se izbegava loše grupisanje kod standardnih k-means algoritama.