Polynomial-time algorithms for Multimarginal Optimal Transport problems with structure.
Jason M. AltschulerEnric Boix-AdseràPublished in: CoRR (2020)
Keyphrases
- optimization problems
- worst case
- computational complexity
- benchmark problems
- difficult problems
- exhaustive search
- test problems
- search methods
- decision problems
- approximate solutions
- computational problems
- practical problems
- related problems
- combinatorial optimization problems
- np hardness
- run times
- min sum
- suboptimal solutions
- np complete
- significant improvement
- data structure
- optimal solution
- learning algorithm
- combinatorial optimization
- computationally efficient
- special case
- problems in computer vision
- bayesian networks
- fixed parameter tractable
- data mining