Papers
Topics
Authors
Recent
Search
2000 character limit reached

Polynomial-Time Solvers for the Discrete $\infty$-Optimal Transport Problems

Published 26 Apr 2023 in math.OC and cs.LG | (2304.13467v1)

Abstract: In this note, we propose polynomial-time algorithms solving the Monge and Kantorovich formulations of the $\infty$-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.

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Generate Now

Authors (1)

  1. Meyer Scetbon 

Collections

Sign up for free to add this paper to one or more collections.

Sign Up