Wasserstein barycenters are NP-hard to compute.
Jason M. AltschulerEnric Boix-AdseràPublished in: CoRR (2021)
Keyphrases
- artificial intelligence
- np hard
- scheduling problem
- special case
- approximation algorithms
- optimal solution
- linear programming
- pointwise
- integer programming
- np hardness
- np complete
- lower bound
- worst case
- closely related
- decision problems
- minimum cost
- computational complexity
- greedy heuristic
- database
- hidden markov models
- data structure
- constraint satisfaction problems
- computer vision
- learning algorithm
- databases