Polynomial-time algorithms for multimarginal optimal transport problems with structure.
Jason M. AltschulerEnric Boix-AdseràPublished in: Math. Program. (2023)
Keyphrases
- worst case
- optimization problems
- computational complexity
- problems in computer vision
- benchmark problems
- computational problems
- approximate solutions
- decision problems
- data structure
- combinatorial optimization problems
- combinatorial optimization
- np complete
- learning algorithm
- practical problems
- difficult problems
- theoretical guarantees
- constraint satisfaction problems
- greedy algorithm
- scheduling problem
- dynamic programming
- significant improvement
- linear space
- computationally hard