On the computational complexity of finding a sparse Wasserstein barycenter (Q2025065)

From MaRDI portal
Revision as of 20:34, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
On the computational complexity of finding a sparse Wasserstein barycenter
scientific article

    Statements

    On the computational complexity of finding a sparse Wasserstein barycenter (English)
    0 references
    0 references
    0 references
    11 May 2021
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Wasserstein barycenter
    0 references
    optimal transport
    0 references
    sparsity
    0 references
    complexity theory
    0 references
    3-dimensional matching
    0 references
    0 references