$k$-Median clustering under discrete Fréchet and Hausdorff distances
We give the first near-linear time (1+ε)-approximation algorithms for k-median clustering of polygonal trajectories under the discrete Fréchet distance, and finite point sets under the Hausdorff distance, provided the complexity of each cluster center, ambient dimension, and k are bounded by a cons...
Na minha lista:
| Principais autores: | , |
|---|---|
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado em: |
Carleton University
2022-09-01
|
| coleção: | Journal of Computational Geometry |
| Acesso em linha: | https://jocg.org/index.php/jocg/article/view/3961 |
| Tags: |
Sem tags, seja o primeiro a adicionar uma tag!
|