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

Gennaro Auricchio, Federico Bassetti, Stefano Gualandi, Marco Veneroni. Computing Kantorovich-Wasserstein Distances on d-dimensional histograms using (d+1)-partite graphs. In Samy Bengio, Hanna M. Wallach, Hugo Larochelle, Kristen Grauman, Nicolò Cesa-Bianchi, Roman Garnett, editors, Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, NeurIPS 2018, 3-8 December 2018, Montréal, Canada. pages 5798-5808, 2018. [doi]

@inproceedings{AuricchioBGV18,
  title = {Computing Kantorovich-Wasserstein Distances on d-dimensional histograms using (d+1)-partite graphs},
  author = {Gennaro Auricchio and Federico Bassetti and Stefano Gualandi and Marco Veneroni},
  year = {2018},
  url = {http://papers.nips.cc/paper/7821-computing-kantorovich-wasserstein-distances-on-d-dimensional-histograms-using-d1-partite-graphs},
  researchr = {https://researchr.org/publication/AuricchioBGV18},
  cites = {0},
  citedby = {0},
  pages = {5798-5808},
  booktitle = {Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, NeurIPS 2018, 3-8 December 2018, Montréal, Canada},
  editor = {Samy Bengio and Hanna M. Wallach and Hugo Larochelle and Kristen Grauman and Nicolò Cesa-Bianchi and Roman Garnett},
}