30 citations · 54 across the 4 of their papers we have counts for
4 papers
Wasserstein barycenters are NP-hard to compute
Jason M. Altschuler, Enric Boix-Adsera
Computing Wasserstein barycenters (a.k.a. Optimal Transport barycenters) is a fundamental problem in geometry which has recently attracted considerable attention due to many applic…
Hardness results for Multimarginal Optimal Transport problems
Jason M. Altschuler, Enric Boix-Adsera
Multimarginal Optimal Transport (MOT) is the problem of linear programming over joint probability distributions with fixed marginals. A key issue in many applications is the comple…
Polynomial-time algorithms for Multimarginal Optimal Transport problems with structure
Jason M. Altschuler, Enric Boix-Adsera
Multimarginal Optimal Transport (MOT) has attracted significant interest due to applications in machine learning, statistics, and the sciences. However, in most applications, the s…
Wasserstein barycenters can be computed in polynomial time in fixed dimension
Jason M. Altschuler, Enric Boix-Adsera
Computing Wasserstein barycenters is a fundamental geometric problem with widespread applications in machine learning, statistics, and computer graphics. However, it is unknown whe…