Pages that link to "Item:Q2025065"
From MaRDI portal
The following pages link to On the computational complexity of finding a sparse Wasserstein barycenter (Q2025065):
Displaying 11 items.
- An inexact PAM method for computing Wasserstein barycenter with unknown supports (Q1983867) (← links)
- Hardness results for multimarginal optimal transport problems (Q2067496) (← links)
- A column generation approach to the discrete barycenter problem (Q2691196) (← links)
- Fast Discrete Distribution Clustering Using Wasserstein Barycenter With Sparse Support (Q4620758) (← links)
- (Q4998935) (← links)
- Wasserstein Barycenters Are NP-Hard to Compute (Q5065469) (← links)
- Randomized Wasserstein Barycenter Computation: Resampling with Statistical Guarantees (Q5065473) (← links)
- Location Problems with Cutoff (Q6053539) (← links)
- On the Computational Complexity of Finding a Sparse Wasserstein Barycenter (Q6327347) (← links)
- ANOVA for metric spaces, with applications to spatial data (Q6577812) (← links)
- Computing Wasserstein barycenters via operator splitting: the method of averaged marginals (Q6633048) (← links)