On the complexity of the optimal transport problem with graph-structured cost.
Jiaojiao FanIsabel HaaslerJohan KarlssonYongxin ChenPublished in: AISTATS (2022)
Keyphrases
- structured data
- worst case
- minimum cost
- expected cost
- random walk
- graph structure
- optimal solution
- optimal cost
- optimal planning
- graph theoretic
- total cost
- graph theory
- min sum
- spanning tree
- high cost
- average cost
- graph representation
- solution path
- constant factor
- error tolerance
- path length
- long run
- graph model
- directed acyclic graph
- closed form
- upper bound