1. P. K. Agarwal, K. Fox, D. Panigrahi, K. R. Varadarajan and A. Xiao, Faster algorithms for the geometric transportation problem, in: B. Aronov and M. J. Katz (eds.), 33rd International Symposium on Computational Geometry (SoCG 2017), Leibniz International Proceedings in Informatics (LIPIcs) 77, Schloss Dagstuhl–Leibniz-Zentrum für Informatik (Dagstuhl, Germany, 2017), pp. 7:1–7:16.
2. M. Ajtai, J. Komlós and G. Tusnády, On optimal matchings, Combinatorica, 4 (1984), 259–264.
3. N. Alon, Explicit construction of exponential sized families of k-independent sets, Discrete Math., 58 (1986), 191–193.
4. J. Altschuler, J. Niles-Weed and P. Rigollet, Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration, in: I. Guyon et al. (eds), Advances in Neural Information Processing Systems 30 (NIPS 2017), Curran Associates Inc. (Red Hook, NY, 2017), pp. 1964–1974.
5. J. Altschuler, F. Bach, A. Rudi and J. Weed, Massively scalable Sinkhorn distances via the Nyström method, in: H. Wallach et al. (eds), Advances in Neural Information Processing Systems 32 (NIPS 2019), Curran Associates Inc. (Red Hook, NY, 2019), pp. 4427–4437.