12 citations · 12 across the 4 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
cs.LG2019★ 12 cited
A Graph Theoretic Additive Approximation of Optimal Transport
Nathaniel Lahn, Deepika Mulchandani, Sharath Raghvendra
Transportation cost is an attractive similarity measure between probability distributions due to its many useful theoretical properties. However, solving optimal transport exactly…
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…