This repository contains additional material for the paper:
- Gennaro Auricchio, Federico Bassetti, Stefano Gualandi, Marco Veneroni. Computing Kantorovich-Wasserstein Distances on d-dimensional histograms using (d+1)-partite graphs. In Proc NeurIPS 2018, Montreal Canada. arXiv:1805.07416v1
The repository is organized as follows:
- NeurIPS poster to be presented during the conference
- Matlab source code of our implementation of the Sinkhorn's algorithm used in the comparison
- (ops... work in progress, the code is on the way...) C++ source code of our solver for the (d+1)-partite formulation. Our implementation relies on the Network Simplex of the Lemon Graph Library