6 citations · 17 across the 16 of their papers we have counts for
4 papers · 1 filter
An implementation of steepest-descent augmentation for linear programs
Steffen Borgwardt, Charles Viss
Generalizing the simplex method, circuit augmentation schemes for linear programs follow circuit directions through the interior of the underlying polyhedron. Steepest-descent augm…
On the Computational Complexity of Finding a Sparse Wasserstein Barycenter
Steffen Borgwardt, Stephan Patterson
The discrete Wasserstein barycenter problem is a minimum-cost mass transport problem for a set of probability measures with finite support. In this paper, we show that finding a ba…
A Column Generation Approach to the Discrete Barycenter Problem
Steffen Borgwardt, Stephan Patterson
The discrete Wasserstein barycenter problem is a minimum-cost mass transport problem for a set of discrete probability measures. Although an exact barycenter is computable through…
Constructing Clustering Transformations
Steffen Borgwardt, Charles Viss
Clustering is one of the fundamental tasks in data analytics and machine learning. In many situations, different clusterings of the same data set become relevant. For example, diff…