M. Agueh and G. Carlier, Barycenters in the wasserstein space, SIAM Journal on Mathematical Analysis, vol.43, issue.2, pp.904-924, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00637399

J. Altschuler, F. Bach, A. Rudi, and J. Weed, Approximating the Quadratic Transportation Metric in Near-Linear Time, 2018.

J. Altschuler, J. Weed, and P. Rigollet, Near-linear time approximation algorithms for optimal transport via sinkhorn iteration, 2017.

E. Anderes, S. Borgwardt, and J. Miller, Discrete Wasserstein Barycenters: Optimal Transport for Discrete Data, 2015.

G. Auricchio, F. Bassetti, S. Gualandi, and M. Veneroni, Computing kantorovichwasserstein distances on d-dimensional histograms using (d + 1)-partite graphs, 2018.

R. Becker, A. Karrenbauer, S. Krinninger, and C. Lenzen, Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models, 2016.

M. Bernot, V. Caselles, and J. Morel, Optimal transportation networks: models and theory, 2008.

J. Blanchet, A. Jambulapati, C. Kent, and A. Sidford, Towards Optimal Running Times for Optimal Transport, 2018.

M. Blondel, V. Seguy, and A. Rolet, Smooth and Sparse Optimal Transport, 2017.

N. Bonneel, J. Rabin, G. Peyré, and H. Pfister, Sliced and radon wasserstein barycenters of measures, Journal of Mathematical Imaging and Vision, vol.51, issue.1, pp.22-45, 2015.
URL : https://hal.archives-ouvertes.fr/hal-00881872

N. Bonneel, M. Van-de-panne, S. Paris, and W. Heidrich, Displacement interpolation using lagrangian mass transport, ACM Trans. Graph, vol.30, issue.6, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00763270

S. Claici, E. Chien, and J. Solomon, , 2018.

P. Clement and W. Desch, An elementary proof of the triangle inequality for the wasserstein metric, Proceedings of the, vol.136, pp.333-339, 2008.

M. Cuturi, Sinkhorn distances: Lightspeed computation of optimal transport, Conference on Neural Information Processing Systems (NIPS'13), pp.2292-2300, 2013.

M. Cuturi and A. Doucet, Fast computation of wasserstein barycenters, International Conference on Machine Learning (ICML'14), pp.685-693, 2014.

A. Dessein, N. Papadakis, and J. Rouas, Regularized optimal transport and the rot mover's distance, Journal of Machine Learning Research, vol.19, issue.15, pp.1-53, 2018.

S. Ferradans, N. Papadakis, G. Peyré, and J. Aujol, Regularized discrete optimal transport, SIAM Journal on Imaging Sciences, vol.7, issue.3, pp.1853-1882, 2014.
URL : https://hal.archives-ouvertes.fr/hal-00797078

A. Forrow, J. Hütter, M. Nitzan, P. Rigollet, G. Schiebinger et al., Statistical Optimal Transport via Factored Couplings, 2018.

C. Gottschlich and D. Schuhmacher, The shortlist method for fast computation of the earth mover's distance and finding optimal solutions to transportation problems, PLoS ONE, vol.9, issue.10, pp.1-10, 2014.

T. L. Gouic and J. Loubes, Existence and consistency of wasserstein barycenters, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01163262

T. Hurtut, Y. Gousseau, and F. Schmitt, Adaptive image retrieval based on the spatial organization of colors, Computer Vision and Image Understanding, vol.112, issue.2, pp.101-113, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00430456

, Library for efficient modeling and optimization in networks, 2010.

W. Li, E. K. Ryu, S. Osher, W. Yin, and W. Gangbo, A parallel method for earth mover's distance, Journal of Scientific Computing, vol.75, issue.1, pp.182-197, 2018.

J. Liu, W. Yin, W. Li, and Y. Chow, Multilevel Optimal Transport: a Fast Approximation of Wasserstein-1 distances, 2018.

D. G. Luenberger and Y. Ye, Linear and Nonlinear Programming, 2015.

R. J. Mccann, A convexity principle for interacting gases, Advances in Mathematics, vol.128, issue.1, pp.153-179, 1997.

Q. Mérigot, A multiscale approach to optimal transport, Computer Graphics Forum, vol.30, pp.1583-1592, 2011.

A. M. Oberman and Y. Ruan, An efficient linear programming method for Optimal Transportation, 2015.

J. B. Orlin, S. A. Plotkin, and É. Tardos, Polynomial dual network simplex algorithms, Mathematical Programming, vol.60, issue.1, pp.255-276, 1993.

F. Paty and M. Cuturi, , 2019.

O. Pele and M. Werman, A linear time histogram metric for improved sift matching, European Conference on Computer Vision (ECCV'08), pp.495-508, 2008.

O. Pele and M. Werman, Fast and robust earth mover's distances, IEEE International Conference on Computer Vision (ICCV'09), pp.460-467, 2009.

G. Peyré and M. Cuturi, , 2018.

J. Rabin, G. Peyré, J. Delon, and M. Bernot, Wasserstein barycenter and its application to texture mixing, Scale Space and Variational Methods in Computer Vision, pp.435-446, 2012.

Y. Rubner, C. Tomasi, and L. Guibas, A metric for distributions with applications to image databases, IEEE Int. Conference on Computer Vision (ICCV'98), pp.59-66, 1998.

F. Santambrogio, Optimal transport for applied mathematicians, Progress in Nonlinear Differential Equations and their applications, vol.87, 2015.

M. A. Schmitz, M. Heitz, N. Bonneel, F. M. Ngolè-mboula, D. Coeurjolly et al., Wasserstein Dictionary Learning: Optimal Transport-based unsupervised non-linear dictionary learning, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01717943

B. Schmitzer, A sparse multiscale algorithm for dense optimal transport, Journal of Mathematical Imaging and Vision, vol.56, issue.2, pp.238-259, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01385274

B. Schmitzer, Stabilized Sparse Scaling Algorithms for, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01385251

J. Schrieber, D. Schuhmacher, and C. Gottschlich, , 2016.

V. Seguy, B. Bhushan-damodaran, R. Flamary, N. Courty, A. Rolet et al., , 2017.

J. Solomon, F. De-goes, G. Peyré, M. Cuturi, A. Butscher et al., Convolutional wasserstein distances: Efficient optimal transportation on geometric domains, ACM Transactions on Graphics (SIGGRAPH'15), 2015.

A. Thibault, L. Chizat, C. Dossal, and N. Papadakis, , 2017.

P. Tseng, Convergence of a block coordinate descent method for nondifferentiable minimization, Journal of Optimization Theory and Applications, vol.109, issue.3, pp.475-494, 2001.

C. Villani, Optimal transport: old and new, vol.338, 2008.

J. Ye, P. Wu, J. Z. Wang, and J. Li, Fast discrete distribution clustering using wasserstein barycenter with sparse support, IEEE Trans. on Signal Processing, vol.65, issue.9, pp.2317-2332, 2017.