6 citations · 17 across the 16 of their papers we have counts for
Showing 2020Show all
2 papers · 1 filter
math.OC2020
An Algorithm for the Separation-Preserving Transition of Clusterings
Steffen Borgwardt, Felix Happach, Stetson Zirkelbach
The separability of clusters is one of the most desired properties in clustering. There is a wide range of settings in which different clusterings of the same data set appear. We a…
math.OC2020
A Note on the Approximability of Deepest-Descent Circuit Steps
Steffen Borgwardt, Cornelius Brand, Andreas Emil Feldmann +1
Linear programs (LPs) can be solved by polynomially many moves along the circuit direction improving the objective the most, so-called deepest-descent steps (dd-steps). Computing t…