On the Computational Complexity of Finding a Sparse Wasserstein Barycenter
From MaRDI portal
Publication:6327347
DOI10.1007/s10878-021-00713-5zbMath1511.68122arXiv1910.07568MaRDI QIDQ6327347
Stephan Patterson, Steffen Borgwardt
Publication date: 16 October 2019
Analysis of algorithms and problem complexity (68Q25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Discrete location and assignment (90B80) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Optimal transportation (49Q22)
This page was built for publication: On the Computational Complexity of Finding a Sparse Wasserstein Barycenter