159 citations · 192 across the 6 of their papers we have counts for
Showing cs.DSShow all
3 papers · 1 filter
cs.DS2016★ 9 cited
Theoretical Analysis of the -Means Algorithm - A Survey
Johannes Blömer, Christiane Lammersen, Melanie Schmidt +1
The -means algorithm is one of the most widely used clustering heuristics. Despite its simplicity, analyzing its running time and quality of approximation is surprisingly diffic…
cs.DS2011★ 1 cited
Solving the Closest Vector Problem with respect to l_p Norms
Johannes Blömer, Stefanie Naewe
In this paper, we present a deterministic algorithm for the closest vector problem for all l_p-norms, 1 < p < \infty, and all polyhedral norms, especially for the l_1-norm and the…
cs.DS2010★ 159 cited
Analysis of Agglomerative Clustering
Marcel R. Ackermann, Johannes Blömer, Daniel Kuntze +1
The diameter -clustering problem is the problem of partitioning a finite subset of into subsets called clusters such that the maximum diameter of the clusters…