v1v2v3 (latest)

On the Computation of Kantorovich-Wasserstein Distances between 2D-Histograms by Uncapacitated Minimum Cost Flows

2 April 2018

Papers citing "On the Computation of Kantorovich-Wasserstein Distances between 2D-Histograms by Uncapacitated Minimum Cost Flows"

2 / 2 papers shown

Title
Multilevel Optimal Transport: a Fast Approximation of Wasserstein-1 distances Jialin Liu W. Yin Wuchen Li Y. T. Chow OT 41 37 0 29 Sep 2018
Computing Kantorovich-Wasserstein Distances on $d$ -dimensional histograms using $(d+1)$ -partite graphs Gennaro Auricchio F. Bassetti Stefano Gualandi Marco Veneroni 21 20 0 18 May 2018