S. Raghvendra

activity

20172026

p

-Wasserstein-Based Metric for Comparing Distributions

3 citations · 3 across the 8 of their papers we have counts for

collaborators

Showing cs.DSShow all

2 papers · 1 filter

cs.DS2022

Deterministic, Near-Linear $ε$ -Approximation Algorithm for Geometric Bipartite Matching

Pankaj K. Agarwal, Hsien-Chih Chang, Sharath Raghvendra +1

Given point sets $A$ and $B$ in $R^{d}$ where $A$ and $B$ have equal size $n$ for some constant dimension $d$ and a parameter $ε > 0$ , we present the first determini…

cs.DS2018

A Faster Algorithm for Minimum-Cost Bipartite Matching in Minor-Free Graphs

Nathaniel Lahn, Sharath Raghvendra

We give an $O ~ (n^{7/5} lo g (n C))$ -time algorithm to compute a minimum-cost maximum cardinality matching (optimal matching) in $K_{h}$ -minor free graphs with $h = O (1)$ and inte…

Deterministic, Near-Linear ε-Approximation Algorithm for Geometric Bipartite Matching

A Faster Algorithm for Minimum-Cost Bipartite Matching in Minor-Free Graphs

Deterministic, Near-Linear $ε$ -Approximation Algorithm for Geometric Bipartite Matching