Recommendations
- Convolutional Wasserstein distances: efficient optimal transportation on geometric domains
- Optimal transport: discretization and algorithms
- A Volumetric approach to Monge's optimal transport on surfaces
- Fast iterative solution of the optimal transport problem on graphs
- Error bounds for discretized optimal transport and its reliable efficient numerical solution
Cited in
(14)- Coupling matrix manifolds assisted optimization for optimal transport problems
- Domain decomposition for entropy regularized optimal transport
- Optimal transport: discretization and algorithms
- Discrete Wasserstein barycenters: optimal transport for discrete data
- Chain Rule Optimal Transport
- On discontinuity of planar optimal transport maps
- Minimizing optimal transport for functions with fixed-size nodal sets
- Optimal Mass Transport on Euclidean Spaces
- Discrete Optimal Transport with Independent Marginals is #P-Hard
- Optimal Transport on Discrete Domains
- A Volumetric approach to Monge's optimal transport on surfaces
- On a generalization of Wasserstein distance and the Beckmann problem to connection graphs
- Spatial multivariate morphing transformation
- A network model for urban planning
This page was built for publication: Optimal transport on discrete domains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5886892)