2 citations · 3 across the 2 of their papers we have counts for
3 papers
A Local-Search Algorithm for Steiner Forest
Martin Groß, Anupam Gupta, Amit Kumar +4
In the Steiner Forest problem, we are given a graph and a collection of source-sink pairs, and the goal is to find a subgraph of minimum total length such that all pairs are connec…
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…
Solving -means on High-dimensional Big Data
Jan-Philipp W. Kappmeier, Daniel R. Schmidt, Melanie Schmidt
In recent years, there have been major efforts to develop data stream algorithms that process inputs in one pass over the data with little memory requirement. For the -means pro…