A Direct tilde{O}(1/epsilon) Iteration Parallel Algorithm for Optimal Transport

Optimal transportation, or computing the Wasserstein or "earth mover's" distance between two n-dimensional distributions, is a fundamental primitive which arises in many learning and statistical settings.