A Robust Exact Algorithm for the Euclidean Bipartite Matching Problem Department of Computer Science, Virginia Tech
–Neural Information Processing Systems
Algorithms for the minimum-cost bipartite matching can be used to estimate Wasserstein distance between two distributions.
Neural Information Processing Systems
Feb-11-2025, 07:07:45 GMT