On the computational complexity of finding a sparse Wasserstein barycenter (Q2025065): Difference between revisions

@@ Property / DOI @@
-.1007/s10878-021-00713-5
@@ Property / DOI: 10.1007/s10878-021-00713-5 / rank @@
-Normal rank
@@ Property / cites work @@
+Discrete Wasserstein barycenters: optimal transport for discrete data
+Normal rank
@@ Property / cites work @@
+Iterative Bregman Projections for Regularized Transportation Problems
+Normal rank
@@ Property / cites work @@
+Convergence of Entropic Schemes for Optimal Transport and Gradient Flows
+Normal rank
@@ Property / cites work @@
+Planar 3DM is NP-complete
@@ Property / cites work: Planar 3DM is NP-complete / rank @@
+Normal rank
@@ Property / cites work @@
+Geometric three-dimensional assignment problems
@@ Property / cites work: Geometric three-dimensional assignment problems / rank @@
+Normal rank
@@ Property / cites work @@
+A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
+Normal rank
@@ Property / cites work @@
+Fast Entropic Regularized Optimal Transport Using Semidiscrete Cost Approximation
+Normal rank
@@ Property / cites work @@
+Optimal Transport
@@ Property / cites work: Optimal Transport / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/S10878-021-00713-5
@@ Property / DOI: 10.1007/S10878-021-00713-5 / rank @@
+Normal rank