Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration.
Jason AltschulerJonathan WeedPhilippe RigolletPublished in: NIPS (2017)
Keyphrases
- approximation algorithms
- worst case
- minimum cost
- constant factor
- np hard
- vertex cover
- special case
- approximation schemes
- facility location problem
- lower bound
- network design problem
- primal dual
- open shop
- approximation ratio
- set cover
- upper bound
- randomized algorithms
- precedence constraints
- np hardness
- approximation guarantees
- optimal solution
- undirected graph
- scheduling problem
- greedy algorithm
- error bounds
- polynomial time approximation
- objective function
- finding optimal
- genetic algorithm