1 citations · 1 across the 2 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
math.OC2019
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…
math.OC2019
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…