Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration.
Jason AltschulerJonathan WeedPhilippe RigolletPublished in: CoRR (2017)
Keyphrases
- approximation algorithms
- worst case
- minimum cost
- np hard
- constant factor
- special case
- vertex cover
- facility location problem
- set cover
- network design problem
- approximation guarantees
- approximation schemes
- greedy algorithm
- open shop
- upper bound
- dynamic programming
- lower bound
- disjoint paths
- randomized algorithms
- approximation ratio
- np hardness
- precedence constraints
- optimal solution
- computational complexity
- optimal strategy
- primal dual
- error bounds
- linear programming