Fetching the paper…
Reading the bibliography…
The discrete Wasserstein barycenter problem is a minimum-cost mass transport problem for a set of probability measures with finite support.
Reducability among Combinatorial Problems
R.M. Karp · 1972
Earlier work this paper cites.
Planar 3DM is NP-Complete
M.E. Dyer and A.M. Frieze · 1986
Earlier work this paper cites.
A strongly polynomial algorithm to solve combinatorial linear programs
E. Tardos · 1986
Earlier work this paper cites.
Some Geometric Clustering Problems
U. Pferschy, R. Rudolf, and G. Woeginger · 1994
Earlier work this paper cites.
Geometric Three-Dimensional Assignment Problems
F. Spieksma and G. Woeginger · 1996
Earlier work this paper cites.
Optimal transport: old and new
C. Villani · 2009
Earlier work this paper cites.
Wasserstein Barycenter and its Application to Texture Mixing
J. Rabin, G. Peyre, J. Delon, and M. Bernot · 2012
Cited alongside, same era.
Fast Computation of Wasserstein Barycenters
M. Cuturi and A. Doucet · 2014
Cited alongside, same era.
Iterative Bregman Projections for Regularized Transportation Problems
J.-D. Benamou, G. Carlier, M. Cuturi, L. Nenna, and G. Peyré · 2015
Cited alongside, same era.
Discrete Wasserstein Barycenters: Optimal Transport for Discrete Data
E. Anderes, S. Borgwardt, and J. Miller · 2016
Cited alongside, same era.
Transportation Networks and Matroids: Algorithms through Circuits and Polyhedrality, 2016
J. Miller · 2016
Cited alongside, same era.
Convergence of Entropic Schemes for Optimal Transport and Gradient Flows
G. Carlier, V. Duval, G. Peyré, and B. Schmitzer · 2017
Cited alongside, same era.
Differential Properties of Sinkhorn Approximation for Learning with Wasserstein Distance
G. Luise, A. Rudi, M. Pontil, and C. Ciliberto · 2018
Later among the works it cites.
Fast Entropic Regularized Optimal Transport Using Semidiscrete Cost Approximation
E. Tenetov, G. Wolansky, and R. Kimmel · 2018
Later among the works it cites.
Statistical Aspects of Wasserstein Distances
V. Panaretos and Y. Zemel · 2019
Closest in time.
An LP-based, Strongly Polynomial 2-Approximation Algorithm for Sparse Wasserstein Barycenters
S. Borgwardt · 2020
Closest in time.
Improved Linear Programs for Discrete Barycenters
S. Borgwardt and S. Patterson · 2020
Closest in time.
A Fast Globally Linearly Convergent Algorithm for the Computation of Wasserstein Barycenters
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
L. Yang, J. Li, D. Sun, and K.-C. Toh · 2020
Closest in time.