Computing Kantorovich-Wasserstein Distances on $d$-dimensional histograms using $(d+1)$-partite graphs

Gennaro Auricchio, Federico Bassetti, Stefano Gualandi, Marco Veneroni

Neural Information Processing Systems 

Nowadays, the most popular methods are based on (i) the Sinkhorn's algorithm