English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

In this note, we propose polynomial-time algorithms solving the Monge andKantorovich formulations of the $\infty$-optimal transport problem in thediscrete and finite setting. It is the first time, to the best of ourknowledge, that efficient numerical methods for these problems have beenproposed.

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