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):
Displayed 6 items.
- Hardness results for multimarginal optimal transport problems (Q2067496) (← links)
- A column generation approach to the discrete barycenter problem (Q2691196) (← 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)