Defines Hausdorff-style and Wasserstein-style metrics on C-sets, proving the latter are convex relaxations of the former and computable as linear programs.
The ∞ -Wasserstein distance: Local solutions and existence of optimal transpo rt maps
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Hausdorff and Wasserstein metrics on graphs and other structured data
Defines Hausdorff-style and Wasserstein-style metrics on C-sets, proving the latter are convex relaxations of the former and computable as linear programs.