1 citations · 1 across the 2 of their papers we have counts for
2 papers
cs.DS2019
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…
cs.DS2014★ 1 cited
Solving Totally Unimodular LPs with the Shadow Vertex Algorithm
Tobias Brunsch, Anna Großwendt, Heiko Röglin
We show that the shadow vertex simplex algorithm can be used to solve linear programs in strongly polynomial time with respect to the number of variables, the number of con…