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

From MaRDI portal





preprint article from arXiv
Language Label Description Also known as
English
Computing Kantorovich-Wasserstein Distances on $d$-dimensional histograms using $(d+1)$-partite graphs
preprint article from arXiv

    Statements

    18 May 2018
    0 references
    math.OC
    0 references
    stat.ML
    0 references
    Gennaro Auricchio
    0 references
    Federico Bassetti
    0 references
    Stefano Gualandi
    0 references
    Marco Veneroni
    0 references

    Identifiers

    0 references