An LP-based, strongly-polynomial 2-approximation algorithm for sparse Wasserstein barycenters.
Steffen BorgwardtPublished in: Oper. Res. (2022)
Keyphrases
- strongly polynomial
- linear programming
- dynamic programming
- optimal solution
- objective function
- pointwise
- k means
- np hard
- mathematical model
- ant colony optimization
- cost function
- computational complexity
- worst case
- learning algorithm
- shortest path problem
- search space
- solution quality
- simulated annealing
- minimum cost flow
- knapsack problem
- linear program
- optimization algorithm
- genetic programming
- search algorithm
- reinforcement learning