Algorithms for the transportation problem in geometric settings
From MaRDI portal
Recommendations
- Faster algorithms for the geometric transportation problem
- Using geometry to solve the transportation problem in the plane
- Preconditioning for the Geometric Transportation Problem
- Approximation algorithms for bipartite matching with metric and geometric costs
- Efficient Minimum Cost Matching and Transportation Using the Quadrangle Inequality
Cites work
- A data structure for dynamic trees
- A near-linear constant-factor approximation for Euclidean bipartite matching?
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- Dynamic Euclidean minimum spanning trees and extrema of binary functions
- Efficient Sketches for Earth-Mover Distance, with Applications
- Faster Scaling Algorithms for Network Problems
- Fully Dynamic Maximal Matching in O (log n) Update Time
- Geometry Helps in Matching
- scientific article; zbMATH DE number 6381629 (Why is no real title available?)
- scientific article; zbMATH DE number 1305475 (Why is no real title available?)
- scientific article; zbMATH DE number 3793772 (Why is no real title available?)
- Sublinear algorithms in the external memory model
- Using geometry to solve the transportation problem in the plane
- Vertical Decomposition of Shallow Levels in 3-Dimensional Arrangements and Its Applications
Cited in
(26)- Using geometry to solve the transportation problem in the plane
- On universally consistent and fully distribution-free rank tests of vector independence
- FPTAS for minimizing the earth mover's distance under rigid transformations and related problems
- Topological learning for brain networks
- Algorithms for the minimax transportation problem
- Reprint of: Optimally solving a transportation problem using Voronoi diagrams
- scientific article; zbMATH DE number 1156568 (Why is no real title available?)
- Geometry helps to compare persistence diagrams
- Faster algorithms for the geometric transportation problem
- Preconditioning for the geometric transportation problem
- On geometric prototype and applications
- scientific article; zbMATH DE number 7455732 (Why is no real title available?)
- Efficient algorithms for geometric partial matching
- Preconditioning for the Geometric Transportation Problem
- A weighted approach to the maximum cardinality bipartite matching problem with applications in geometric settings
- Approximate minimum-weight matching with outliers under translation
- A near-linear time approximation scheme for geometric transportation with arbitrary supplies and spread
- A near-linear time approximation scheme for geometric transportation with arbitrary supplies and spread
- A data-dependent approach for high-dimensional (robust) Wasserstein alignment
- A fast algorithm for constructing Monge sequences in transportation problems with forbidden arcs
- Parallel complexity of geometric bipartite matching
- Geometric bipartite matching based exact algorithms for server problems
- Pitman efficiency lower bounds for multivariate distribution-free tests based on optimal transport
- Entropy based transportation problem use geometric programming method
- An algorithm for semi-infinite transportation problems
- Computational aspects of the optimal transit path problem
This page was built for publication: Algorithms for the transportation problem in geometric settings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5743402)
