Polynomial-Time Solvers for the Discrete ∞-Optimal Transport Problems
Abstract
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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.