Preprint
Aug 2026
Faster Algorithms for Multimarginal Optimal Transport
We study constructive discrete multimarginal optimal transport (MOT) among $m$ distributions on $n$ points, where the cost tensor $C$ has $N=n^m$ entries. For additive accuracy $\varepsilon$, let $\kappa=\max\{1,(\max C-\min C)/\varepsilon\}$. Classically, we give two algorithms that return exactly feasible additive-$\...
Brandon Augustino, Yue Sun, Atithi Acharya et al.
· 0 citations