Abhinandan Nath

activity

20152021

most citedComputing the Gromov-Hausdorff Distance for Metric Trees

7 citations · 7 across the 2 of their papers we have counts for

collaborators

Showing cs.CGShow all

3 papers · 1 filter

cs.CG2021

Coresets for $k$ -median clustering under Fréchet and Hausdorff distances

Abhinandan Nath

We give algorithms for computing coresets for $(1 + ε)$ -approximate $k$ -median clustering of polygonal curves (under the discrete and continuous Fréchet distance) and point…

cs.CG2020

k-Median clustering under discrete Fréchet and Hausdorff distances

Abhinandan Nath, Erin Taylor

We give the first near-linear time $(1+\eps)$-approximation algorithm for $k$ -median clustering of polygonal trajectories under the discrete Fréchet distance, and the first polynom…

cs.CG2015★ 7 cited

Computing the Gromov-Hausdorff Distance for Metric Trees

Pankaj K. Agarwal, Kyle Fox, Abhinandan Nath +2

The Gromov-Hausdorff (GH) distance is a natural way to measure distance between two metric spaces. We prove that it is $NP$ -hard to approximate the Gromov-Hausdorff distan…

Coresets for k-median clustering under Fréchet and Hausdorff distances

k-Median clustering under discrete Fréchet and Hausdorff distances

Computing the Gromov-Hausdorff Distance for Metric Trees

Coresets for $k$ -median clustering under Fréchet and Hausdorff distances