Showing cs.CGShow all
2 papers · 1 filter
cs.CG2020
An Time -Approximation Algorithm for RMS Matching in a Plane
Nathaniel Lahn, Sharath Raghvendra
The 2-Wasserstein distance (or RMS distance) is a useful measure of similarity between probability distributions that has exciting applications in machine learning. For discrete di…
cs.CG2019
A Weighted Approach to the Maximum Cardinality Bipartite Matching Problem with Applications in Geometric Settings
Nathaniel Lahn, Sharath Raghvendra
We present a weighted approach to compute a maximum cardinality matching in an arbitrary bipartite graph. Our main result is a new algorithm that takes as input a weighted bipartit…