Abhinandan Nath

collaborators

2 papers

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…

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

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

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