Polynomial-Time Solvers for the Discrete ∞-Optimal Transport Problems
Not on the map. Why?
Abstract (arXiv)
In this note, we propose polynomial-time algorithms solving the Monge and Kantorovich formulations of the ∞-optimal transport problem in the discrete and finite setting. It is the first time, to the best of our knowledge, that efficient numerical methods for these problems have been proposed.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 0 of its 13 references that are in the map. First posted on arXiv 26 Apr 2023.
Builds on
0 of 13 references.
No references here yet.
Built on by
Not cited yet.