3 citations · 8 across the 12 of their papers we have counts for
1 paper · 1 filter
Meyer Scetbon
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…