15 citations · 34 across the 9 of their papers we have counts for
11 papers
The Price of Hierarchical Clustering
Anna Arutyunova, Heiko Röglin
Hierarchical Clustering is a popular tool for understanding the hereditary properties of a data set. Such a clustering is actually a sequence of clusterings that starts with the tr…
Smoothed Analysis of Pareto Curves in Multiobjective Optimization
Heiko Röglin
In a multiobjective optimization problem a solution is called Pareto-optimal if no criterion can be improved without deteriorating at least one of the other criteria. Computing the…
Noisy, Greedy and Not So Greedy k-means++
Anup Bhattacharya, Jan Eube, Heiko Röglin +1
The k-means++ algorithm due to Arthur and Vassilvitskii has become the most popular seeding method for Lloyd's algorithm. It samples the first center uniformly at random from the d…
Analysis of Ward's Method
Anna Großwendt, Heiko Röglin, Melanie Schmidt
We study Ward's method for the hierarchical -means problem. This popular greedy heuristic is based on the \emph{complete linkage} paradigm: Starting with all data points as sing…
Polynomial Kernels for Weighted Problems
Michael Etscheid, Stefan Kratsch, Matthias Mnich +1
Kernelization is a formalization of efficient preprocessing for NP-hard problems using the framework of parameterized complexity. Among open problems in kernelization it has been a…
Finding Short Paths on Polytopes by the Shadow Vertex Algorithm
Tobias Brunsch, Heiko Röglin
We show that the shadow vertex algorithm can be used to compute a short path between a given pair of vertices of a polytope P = {x : Ax \leq b} along the edges of P, where A \in R^…