\({\mathcal{W}}_\infty \)-transport with discrete target as a combinatorial matching problem

DOI10.1007/s00013-021-01606-zzbMath1469.05140arXiv2007.07980OpenAlexW3169033099MaRDI QIDQ2042000

Jun Kitagawa, Mohit Bansil

Publication date: 26 July 2021

Published in: Archiv der Mathematik (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2007.07980

zbMATH Keywords

numericsoptimal transportcombinatorial matching

Mathematics Subject Classification ID

Applications of graph theory (05C90) Numerical optimization and variational techniques (65K10) Transportation, logistics and supply chain management (90B06) Combinatorial probability (60C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Optimal transportation (49Q22)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The \(L^\infty\) optimal transport: infinite cyclical monotonicity and the existence of optimal transport maps
• Finite speed of propagation in porous media by mass transportation methods
• Gromov-Hausdorff limit of Wasserstein spaces on point clouds
• Regularity of potential functions of the optimal transportation problem
• Duality for the $L^{\infty }$ optimal transport problem
• On the Rate of Convergence of Empirical Measures in ∞-transportation Distance
• The $\infty$-Wasserstein Distance: Local Solutions and Existence of Optimal Transport Maps